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 const mod = 0;
bool cmp(int a, int b) { return a > b; }
int main() {
  vector<int> store;
  int n, q, k;
  cin >> n >> k >> q;
  int a[150022];
  for (int i = 0; i < n; i++) cin >> a[i];
  int onl = 0;
  int mn = (1 << 22), mx = 0;
  int up = k;
  while (q) {
    q--;
    int s, h;
    cin >> s >> h;
    if (s == 1) {
      if (onl < up) {
        store.push_back(a[h - 1]);
        onl++;
      } else {
        sort(store.begin(), store.end(), cmp);
        if (a[h - 1] > store[up - 1]) {
          store.pop_back();
          store.push_back(a[h - 1]);
        }
      }
    }
    if (s == 2) {
      bool joj = true;
      int gog = store.size();
      for (int i = 0; i < min(gog, up); i++) {
        if (a[h - 1] == store[i]) {
          cout << "YES";
          joj = false;
          break;
        }
      }
      if (joj) cout << "NO";
      cout << endl;
    }
  }
}
