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 vis[150005], k[150005], fr[150005], vif[150005];
int main() {
  int i, j, n, m, l, h, c, q, f, min1, cc = 0, kk = 0, aa = 0, flag = 0;
  ;
  long long ans1 = 0, ans2 = 0;
  memset(vis, 0, sizeof(vis));
  scanf("%d%d%d", &n, &m, &q);
  k[0] = -1;
  for (i = 1; i <= n; i++) {
    scanf("%d", &k[i]);
    if (k[i] > k[kk]) kk = i;
  }
  for (i = 0; i < q; i++) {
    scanf("%d%d", &c, &f);
    if (c == 1) {
      if (aa < m) {
        fr[aa] = k[f];
        vif[aa] = f;
        vis[f] = 1;
        aa++;
      } else {
        min1 = kk;
        for (j = 0; j < m; j++) {
          if (fr[j] < k[min1]) {
            min1 = vif[j];
          }
        }
        if (k[f] > k[min1]) {
          vis[min1] = 0;
          fr[min1] = k[f];
          vif[min1] = f;
          vis[f] = 1;
          flag = 0;
        }
      }
    } else {
      if (vis[f])
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
}
