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 n, m, q, d, type, id;
struct sort_map {
 public:
  int key, val;
};
bool comp(const sort_map& a, const sort_map& b) { return a.val < b.val; }
bool element(const sort_map& a) { return a.key == id; }
int main() {
  cin >> n >> m >> q;
  map<int, int> mp;
  for (int i = 1; i <= n; i++) {
    cin >> d;
    mp[i] = d;
  }
  vector<sort_map> v;
  vector<sort_map>::iterator it;
  sort_map sm;
  for (int i = 1; i <= q; i++) {
    cin >> type >> id;
    if (type == 1) {
      if (m > 0) {
        sm.key = id, sm.val = mp[id];
        v.push_back(sm);
        m--;
      } else {
        sort(v.begin(), v.end(), comp);
        it = v.begin();
        if ((*it).val < mp[id]) {
          (*it).key = id;
          (*it).val = mp[id];
        }
      }
    } else if (type == 2) {
      bool flag = false;
      if (v.empty()) {
        cout << "NO" << endl;
        continue;
      }
      for (it = v.begin(); it != v.end(); it++) {
        if ((*it).key == id) {
          cout << "YES" << endl;
          flag = true;
          break;
        }
      }
      if (flag == false) {
        cout << "NO" << endl;
      }
    }
  }
  return 0;
}
