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;
const int maxn = 150010;
int v[6], p[6], cnt;
int vis[maxn];
int t[maxn];
int n, k, q;
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &t[i]);
  for (int i = 1; i <= q; i++) {
    int type, id;
    scanf("%d%d", &type, &id);
    if (type == 1) {
      if (cnt < k)
        v[cnt] = t[id], p[cnt] = id, cnt++;
      else
        for (int j = 0; j < cnt; j++)
          if (v[j] > t[id]) {
            v[j] = t[id];
            p[j] = id;
            break;
          }
    } else {
      int flag = 0;
      for (int j = 0; j < cnt; j++)
        if (p[j] == id) flag = 1;
      if (flag)
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
