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;
struct mi_k {
  int id, mi;
};
int main() {
  int n, q, k, t, tip, id, iw, i_o;
  iw = 0;
  i_o = 0;
  bool otv[150000];
  bool vis;
  mi_k l;
  l.id = -1;
  l.mi = INT_MAX;
  int qo[150000];
  int wind[6];
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) cin >> qo[i];
  for (int i = 0; i < k; i++) wind[i] = 0;
  for (int i = 0; i < q; i++) {
    vis = false;
    cin >> tip >> id;
    if (tip == 1) {
      if (iw < k) {
        wind[iw] = id;
        iw++;
      } else if (l.mi < qo[id]) {
        wind[l.id] = id;
        for (int j = 0; j < k; j++)
          if (l.mi > qo[wind[j]]) {
            l.mi = qo[wind[j]];
            l.id = j;
          }
      }
    } else {
      for (int j = 0; j < k; j++) {
        if (wind[j] == id) vis = true;
      }
      if (vis) {
        otv[i_o] = true;
      } else
        otv[i_o] = false;
      i_o++;
    }
  }
  for (int i; i < i_o; i++) {
    if (otv[i]) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
