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;
long long t[150010];
struct node {
  long long priority;
  long long index;
};
int main() {
  long long i, n, k, q, frd, type;
  scanf("%I64d%I64d%I64d", &n, &k, &q);
  for (i = 1; i <= n; i++) {
    scanf("%I64d", &t[i]);
  }
  node display[k + 1];
  long long full = 0;
  long long j = 1;
  for (i = 1; i <= q; i++) {
    scanf("%I64d%I64d", &type, &frd);
    if (type == 1) {
      if (full < k) {
        display[j].priority = t[frd];
        display[j].index = frd;
        full++;
        j++;
      } else {
        long long mi = 899999999, mi_ind;
        for (long long x = 1; x <= full; x++) {
          if (mi > display[x].priority) {
            mi = display[x].priority;
            mi_ind = x;
          }
        }
        if (display[mi_ind].priority < t[frd]) {
          display[mi_ind].priority = t[frd];
          display[mi_ind].index = frd;
        }
      }
    } else {
      long long paisi = 0;
      for (long long ii = 1; ii <= k; ii++) {
        if (display[ii].index == frd) {
          cout << "YES\n";
          paisi = 1;
          break;
        }
      }
      if (paisi == 0) cout << "NO\n";
    }
  }
  return 0;
}
