#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k ; cin>>n>>k;
vector<int>arr(n);
for(int i = 0 ; i<n;i++){
cin>>arr[i];
}
unordered_set<int>hash;
bool ans = false;
for(int i = 0 ; i < n;i++){
if(hash.find(arr[i])!=hash.end()){
ans = true;
break;
}
hash.insert(arr[i]);
if(i>k){
hash.erase(arr[i-k]);
}
}
cout<<ans;
// your code goes here
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG4sayA7IGNpbj4+bj4+azsKCXZlY3RvcjxpbnQ+YXJyKG4pOwoJZm9yKGludCBpID0gMCA7IGk8bjtpKyspewoJCWNpbj4+YXJyW2ldOwoJfQoJdW5vcmRlcmVkX3NldDxpbnQ+aGFzaDsKCWJvb2wgYW5zID0gZmFsc2U7Cglmb3IoaW50IGkgPSAwIDsgaSA8IG47aSsrKXsKCQlpZihoYXNoLmZpbmQoYXJyW2ldKSE9aGFzaC5lbmQoKSl7CgkJCWFucyA9IHRydWU7CgkJCWJyZWFrOwoJCX0KCQloYXNoLmluc2VydChhcnJbaV0pOwoJICAgIGlmKGk+ayl7CgkgICAgCWhhc2guZXJhc2UoYXJyW2kta10pOwoJICAgIH0KCX0KCWNvdXQ8PGFuczsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXJldHVybiAwOwp9