#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a[5]={2,4,7,1,5};
int b[3]={5,4,2};
unordered_map<int,int>m1;
unordered_map<int,int>m2;
for(int i=0;i<5;i++){
m1[a[i]]++;
}
for(int i=0;i<3;i++){
m2[b[i]]++;
}
for(int i=0;i<3;i++){
if(m1.find(b[i])!=m1.end()){
if(m2[b[i]]>m1[b[i]]){
cout<<"there does not exit pair";
return 0;
}
}
}
cout<<"there exit pair";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgYVs1XT17Miw0LDcsMSw1fTsKCWludCBiWzNdPXs1LDQsMn07Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+bTE7Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+bTI7Cglmb3IoaW50IGk9MDtpPDU7aSsrKXsKCQltMVthW2ldXSsrOwoJfQoJZm9yKGludCBpPTA7aTwzO2krKyl7CgkJbTJbYltpXV0rKzsKCX0KCWZvcihpbnQgaT0wO2k8MztpKyspewoJCWlmKG0xLmZpbmQoYltpXSkhPW0xLmVuZCgpKXsKCQkJaWYobTJbYltpXV0+bTFbYltpXV0pewoJCQkJY291dDw8InRoZXJlIGRvZXMgbm90IGV4aXQgcGFpciI7CgkJCQlyZXR1cm4gMDsKCQkJfQoJCX0KCX0KCWNvdXQ8PCJ0aGVyZSBleGl0IHBhaXIiOwoJcmV0dXJuIDA7Cn0=