#include <bits/stdc++.h>
using namespace std;
 
int main() {
	// your code goes here
	int n,k;
	cin>>n>>k;
	int arr[n];
	for(int i = 0; i < n; i++){
		cin>>arr[i];
	}
 
	unordered_map<int, int> ump;
 
	for(int i = 0; i < n; i++){
 
		if(ump.find(arr[i]) == ump.end()){
			ump[arr[i]] = i;
		}
		else{
			int lastIndex = ump[arr[i]];
 
			if(abs(i-lastIndex) <= k){
				cout<<"Pair found"<<endl;
				ump[arr[i]] = i;
			}
		}
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuLGs7CgljaW4+Pm4+Pms7CglpbnQgYXJyW25dOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJY2luPj5hcnJbaV07Cgl9CgkKCXVub3JkZXJlZF9tYXA8aW50LCBpbnQ+IHVtcDsKCQoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJCgkJaWYodW1wLmZpbmQoYXJyW2ldKSA9PSB1bXAuZW5kKCkpewoJCQl1bXBbYXJyW2ldXSA9IGk7CgkJfQoJCWVsc2V7CgkJCWludCBsYXN0SW5kZXggPSB1bXBbYXJyW2ldXTsKCQkJCgkJCWlmKGFicyhpLWxhc3RJbmRleCkgPD0gayl7CgkJCQljb3V0PDwiUGFpciBmb3VuZCI8PGVuZGw7CgkJCQl1bXBbYXJyW2ldXSA9IGk7CgkJCX0KCQl9Cgl9CglyZXR1cm4gMDsKfQ==

NQoKMgoKMyAyIDMgMyAx

5

2

3 2 3 3 1