#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

int main()
{
	int l, c;
	cin >> l >> c;

	vector<int> colors(c);
	int includedColors = 0;
	vector<int> line;
	for (int i = 0; i < l; i++)
	{
		int next;
		cin >> next;
		line.push_back(next);
	}


	int start = 0;
	int end = 0;
	int ans = INT_MAX;

	while (end != l)
	{
		if (colors[line[end]] == 0)
		{
			includedColors++;
		}
		colors[line[end]]++;

		while (colors[line[start]] > 1)
		{
			colors[line[start]]--;
			start++;
		}

		if (includedColors == c)
		{
			ans = min(ans, end - start + 1);
		}
		
		end++;
	}

	cout << ans;
}