#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n ;
int k ;
cin >> n >> k ;
vector<int> v(n);
for(auto &val : v) cin >> val ;
bool flag=0;
unordered_map<int,int> mp ;
for(int i=0 ;i<n ;i++){
if(mp.find(v[i])!=mp.end()){
if(i-mp[v[i]]<=k){
flag=1 ;
break;
}
}
mp[v[i]]=i;
}
if(flag) cout << "Present\n";
else cout << "Not Present\n";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuIDsKCWludCBrIDsKCWNpbiA+PiBuID4+IGsgOwoJdmVjdG9yPGludD4gdihuKTsKCWZvcihhdXRvICZ2YWwgOiB2KSBjaW4gPj4gdmFsIDsKCWJvb2wgZmxhZz0wOwoJdW5vcmRlcmVkX21hcDxpbnQsaW50PiBtcCA7CgkKCWZvcihpbnQgaT0wIDtpPG4gO2krKyl7CgkJaWYobXAuZmluZCh2W2ldKSE9bXAuZW5kKCkpewoJCQlpZihpLW1wW3ZbaV1dPD1rKXsKCQkJCWZsYWc9MSA7CgkJCQlicmVhazsKCQkJfQoJCX0KCQkKCQltcFt2W2ldXT1pOwoJCQoJfQoJaWYoZmxhZykgY291dCA8PCAiUHJlc2VudFxuIjsKCWVsc2UgY291dCA8PCAiTm90IFByZXNlbnRcbiI7CglyZXR1cm4gMDsKfQ==