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() {
  int n, k, q;
  cin >> n >> k >> q;
  long long int a[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int num, id;
  int online[n + 1];
  int t = 0;
  while (q--) {
    cin >> num;
    if (num == 1) {
      cin >> id;
      if (t < k) {
        online[t] = id;
        t++;
      } else {
        int indexValue = 0;
        indexValue = a[id];
        int min = INT_MAX;
        int min_index;
        int flag = 0;
        for (int i = 0; i < t; i++) {
          if (a[online[i]] < indexValue) {
            min_index = i;
            flag = 1;
          }
        }
        if (flag == 1) {
          online[min_index] = id;
        }
      }
    } else {
      cin >> id;
      for (int i = 0; i < t; i++) {
        if (id == online[i]) {
          cout << "YES\n";
          break;
        }
        if (i == t - 1) {
          cout << "NO\n";
        }
      }
    }
  }
}
