#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

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

    vector<int> lights(n);
    for (int i = 0; i < n; i++) {
        cin >> lights[i];
    }

    unordered_map<int, int> colorCount;
    int uniqueColors = 0;

    int left = 0, right = 0;
    int shortestSubsequence = n;

    while (right < n) {
        colorCount[lights[right]]++;

        if (colorCount[lights[right]] == 1) {
            uniqueColors++;
        }

        while (left <= right && colorCount[lights[left]] > 1) {
            colorCount[lights[left]]--;
            left++;
        }

        if (uniqueColors == c) {
            shortestSubsequence = min(shortestSubsequence, right - left + 1);
        }

        right++;
    }

    cout << shortestSubsequence << endl;

    return 0;
}