#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> N; map m; for(i=1;i<=N;i++){ ll a; cin >> a; m[a]++; } int Q; cin >> Q; while(Q--){ ll x,k; cin >> x >> k; if(m.count(x)==0){ cout << "No" << endl; continue; } if(m[x]>=k) cout << "Yes" << endl; else cout << "No" << endl; } return 0; }