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;
const int maxN = 150007;
int rate[maxN], list[6];
bool cmp(int a, int b) { return rate[a] > rate[b]; }
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; ++i) {
    cin >> rate[i];
  }
  int curCount = 0;
  list[k + 1] = 0;
  for (int i = 0; i < q; ++i) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      if (curCount < k) {
        curCount++;
        list[curCount] = id;
        sort(list + 1, list + curCount + 1, cmp);
      } else {
        int j = 1;
        while (rate[list[j]] > rate[id]) {
          j++;
        }
        if (j <= k) {
          for (int cur = 0, t = j; t <= k; ++t) {
            int b = list[t];
            list[t] = cur;
            cur = b;
          }
          list[j] = id;
        }
      }
    } else {
      bool res = false;
      for (int j = 1; j <= curCount; ++j) {
        if (list[j] == id) res = true;
      }
      if (res)
        cout << "YES";
      else
        cout << "NO";
    }
  }
  return 0;
}
