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 friends[150005];
class k_inde {
 public:
  int value = -1, index = -1;
} k_index[150005];
bool cmp(k_inde a, k_inde b) { return a.value < b.value; }
int main() {
  int n, q, k, m, id, sum = 0, find = 0;
  cin >> n >> k >> q;
  for (int ii = 0; ii < n; ii++) cin >> friends[ii];
  for (int ii = 0; ii < q; ii++) {
    cin >> m >> id;
    if (m == 1) {
      if (sum == k) {
        sort(k_index, k_index + k, cmp);
        for (int kk = 0; kk < k; kk++) cout << k_index[kk].value << endl;
        if (friends[id - 1] > friends[k_index[0].index]) {
          k_index[0].index = id - 1;
          k_index[0].value = friends[id - 1];
        }
      }
      if (sum <= k) {
        k_index[sum].index = id - 1;
        k_index[sum].value = friends[id - 1];
        sum++;
      }
    } else if (m == 2) {
      for (int jj = 0; jj < k; jj++) {
        if (k_index[jj].index == id - 1) {
          find = 1;
          break;
        }
      }
      if (find == 1)
        cout << "YES\n";
      else
        cout << "NO\n";
      find = 0;
    }
  }
  return 0;
}
