#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;
}