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;
int main() {
  int x, n, k, q;
  cin >> n >> k >> q;
  int a[n];
  map<int, int> user;
  for (__typeof((n)) i = (0); i < (n); i += 1) {
    cin >> x;
    a[i] = x;
    user[x] = i + 1;
  }
  set<int> online;
  for (__typeof((q)) i = (0); i < (q); i += 1) {
    int type;
    cin >> type;
    if (type == 1) {
      cin >> x;
      if (online.size() < k) {
        online.insert(a[x - 1]);
      } else {
        if (a[x - 1] > *online.begin()) {
          online.erase(*online.begin());
          online.insert(a[x - 1]);
        }
      }
    } else {
      cin >> x;
      if (online.find(a[x - 1]) != online.end()) {
        cout << "YES" << '\n';
      } else {
        cout << "NO" << '\n';
      }
    }
  }
}
