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;
set<int> ids;
map<int, int> relations;
bool vis[300000];
int n, k, q;
int t;
int type;
int id;
int main() {
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    cin >> t;
    relations[i + 1] = t;
  }
  for (int i = 0; i < q; i++) {
    cin >> type >> id;
    if (type == 1) {
      vis[id] = true;
      if (ids.size() < k) {
        ids.insert(id);
      } else {
        int min_rank = 0;
        int min_id;
        for (auto it : ids) {
          if (min_rank == 0 || relations[it] < min_rank) {
            min_rank = relations[it];
            min_id = it;
          }
        }
        if (min_rank != 0 && relations[id] > min_rank) {
          ids.erase(min_id);
          ids.insert(id);
        }
      }
    } else {
      if (!vis[id]) {
        cout << "NO" << endl;
        continue;
      }
      int flag = 0;
      for (auto it : ids) {
        if (it == id) {
          flag = 1;
          break;
        }
      }
      if (flag == 1)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
