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 main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long int N, K, Q;
  cin >> N >> K >> Q;
  long long int a[N + 1], sx, t, id, x;
  for (long long int i = 0; i < N; i++) cin >> a[i];
  priority_queue<long long int, vector<long long int>, greater<long long int> >
      pq;
  for (int i = 1; i <= Q; i++) {
    cin >> x >> id;
    id--;
    if (x == 1) {
      if (!pq.empty()) {
        t = pq.top();
        sx = pq.size();
        if (sx < K)
          pq.push(a[id]);
        else {
          if (t >= a[id])
            continue;
          else {
            pq.pop();
            pq.push(a[id]);
          }
        }
      } else
        pq.push(a[id]);
    } else {
      sx = pq.size();
      if (sx == 0)
        cout << "NO" << '\n';
      else {
        vector<long long int> temp;
        bool flag = false;
        while (!pq.empty()) {
          long long int x = pq.top();
          pq.pop();
          temp.push_back(x);
          if (x == a[id]) {
            flag = true;
            break;
          }
        }
        if (flag == true)
          cout << "YES" << '\n';
        else
          cout << "NO" << '\n';
        for (long long int var = 0; var < temp.size(); var++)
          pq.push(temp[var]);
      }
    }
  }
  return 0;
}
