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 a[150010];
int online[9];
int main() {
  int n, q, k, w = 0, tip, id;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= q; i++) {
    cin >> tip >> id;
    if (tip == 1) {
      int t = a[id];
      if (w < k) {
        online[++w] = id;
      } else {
        int minim = a[online[1]], poz = 1;
        for (int j = 2; j <= k; j++) {
          if (a[online[j]] < minim) {
            minim = a[online[j]];
            poz = j;
          }
        }
        if (minim < a[id]) {
          online[poz] = id;
        }
      }
    } else {
      bool gasit = 0;
      for (int j = 1; j <= k; j++) {
        if (online[j] == id) gasit = 1;
      }
      if (gasit == 1) {
        cout << "YES\n";
      } else
        cout << "NO\n";
    }
  }
  return 0;
}
