1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp1;
map<long long, long long> mp2;
set<long long> s;
int main() {
  long long n, k, q;
  cin >> n >> k >> q;
  for (long long i = 0; i < n; i++) {
    long long t;
    cin >> t;
    mp1[t] = i + 1;
    mp2[i + 1] = t;
  }
  for (long long z = 0; z < q; z++) {
    long long type;
    cin >> type;
    if (type == 1) {
      long long a;
      cin >> a;
      if (s.size() && *s.begin() < mp2[a]) {
        s.erase(s.begin());
        s.insert(mp2[a]);
      } else {
        s.insert(mp2[a]);
      }
    } else {
      long long a;
      cin >> a;
      if (s.count(mp2[a]) != 0) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
    }
  }
}
