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::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  long long n, k, q, i, j, x, y, z, flag;
  while (t--) {
    cin >> n >> k >> q;
    long long a[n], b[n], c[n];
    priority_queue<long long, std::vector<long long> > q1;
    for (i = 0; i < n; i++) {
      cin >> a[i];
      b[i] = 0;
    }
    while (q--) {
      cin >> x >> y;
      if (x == 1) {
        q1.push(a[y - 1]);
        b[y - 1] = 1;
      } else {
        if (q1.size() <= k) {
          if (b[y - 1])
            cout << "YES\n";
          else
            cout << "NO\n";
        } else {
          flag = i = 0;
          z = k;
          while (z--) {
            c[i] = q1.top();
            q1.pop();
            if (c[i] == a[y - 1] && b[y - 1]) {
              cout << "YES\n";
              flag = 1;
              for (j = 0; j < i; j++) q1.push(c[j]);
            }
            i++;
          }
          if (!flag) {
            cout << "NO\n";
            for (j = 0; j < i; j++) q1.push(c[j]);
          }
        }
      }
    }
  }
  return 0;
}
