#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <utility>
#include <numeric>

using namespace std;

using ll = long long;
using ull = unsigned long long;

const ll inf = (ll)1e9;
const ll mod = (ll)1e9 + 7;

int main()
{
	int n, k;
	cin >> n >> k;

	vector<int> a(n);
	for (int i = 0; i < n; i++)
	{
		cin >> a.at(i);
	}

	map<int, int> m;

	int r = 0;
	int ans = inf;
	for (int l = 0; l < n; l++)
	{
		while (r < n && m.size() < k)
		{
			if (a.at(r) <= k)
			{
				m[a.at(r)]++;
			}
			r++;
		}

		if (m.size() == k)
		{
			ans = min(ans, r - l);
		}

		if (l == r)
		{
			r++;
		}
		else
		{
			if (a.at(l) <= k)
			{
				m[a.at(l)]--;
				if (m[a.at(l)] == 0)
				{
					m.erase(a.at(l));
				}
			}
		}
	}

	if (ans == (int)inf)
	{
		ans = 0;
	}

	cout << ans << endl;
}
