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, k, q;
vector<long long> t(n);
priority_queue<long long, std::vector<long long>, std::greater<long long>> pq;
vector<bool> e(n);
void Type1(int id) {
  e[id] = true;
  if (pq.size() < k) {
    pq.push(t[id]);
  } else {
    if (t[id] > pq.top()) {
      pq.pop();
      pq.push(t[id]);
    }
  }
}
char* Type2(int id) {
  if (e[id] == false) return "NO";
  if (t[id] < pq.top()) return "NO";
  return "YES";
}
int main(int argc, char* argv[]) {
  cin >> n >> k >> q;
  t.resize(n);
  e.resize(n);
  fill(e.begin(), e.end(), false);
  for (int i = 0; i < n; ++i) {
    cin >> t[i];
  }
  for (int i = 0; i < q; ++i) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      Type1(id - 1);
    } else {
      cout << Type2(id - 1);
    }
  }
  return 0;
}
