#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,x ; cin>>n>>x;
vector<int>arr(n);
for(int i = 0 ; i<n;i++){
cin>>arr[i];
}
unordered_map<int,int>hash;
for(int i =0;i<n;i++){
if(hash.find(x-arr[i])!=hash.end()){
cout<<"pair found "<<arr[i]<<" "<<x-arr[i]<<"\n";
}
hash[arr[i]]=i; }
// your code goes here
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG4seCA7IGNpbj4+bj4+eDsKCXZlY3RvcjxpbnQ+YXJyKG4pOwoJZm9yKGludCBpID0gMCA7IGk8bjtpKyspewoJCWNpbj4+YXJyW2ldOwoJfQoJdW5vcmRlcmVkX21hcDxpbnQsaW50Pmhhc2g7Cglmb3IoaW50IGkgPTA7aTxuO2krKyl7CgkJaWYoaGFzaC5maW5kKHgtYXJyW2ldKSE9aGFzaC5lbmQoKSl7CgkJCWNvdXQ8PCJwYWlyIGZvdW5kICI8PGFycltpXTw8IiAiPDx4LWFycltpXTw8IlxuIjsKCQl9CgkJaGFzaFthcnJbaV1dPWk7CX0KCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXJldHVybiAwOwp9