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;
struct A {
  int f, x;
} ol[10];
bool cmp(A a, A b) { return a.f < b.f; }
int f[150005];
int v[150005];
int main() {
  int n, k, q, i, t, a;
  scanf("%d %d %d", &n, &k, &q);
  for (i = 1; i <= n; i++) scanf("%d", &f[i]);
  int cnt = k;
  memset(ol, -1, sizeof(ol));
  memset(v, 0, sizeof(v));
  for (i = 0; i < q; i++) {
    scanf("%d %d", &t, &a);
    if (t == 1) {
      if (k) {
        v[a] = 1;
        ol[k - 1].f = f[a];
        ol[k - 1].x = a;
        k--;
      } else {
        sort(ol, ol + cnt, cmp);
        if (ol[0].f < f[a]) {
          v[a] = 1;
          ol[0].f = f[a];
          v[ol[0].x] = 0;
          ol[0].x = a;
        }
      }
    } else {
      if (v[a])
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
