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 good[150000 + 10];
int visit[150000 + 10];
typedef struct Oline {
  int cur;
  int good;
} OL;
OL online[150000 + 10];
bool judge(OL a, OL b) {
  if (a.good < b.good)
    return true;
  else
    return false;
}
int main() {
  int i, j, n, k, q;
  cin >> n >> k >> q;
  for (i = 0; i < n; i++) cin >> good[i];
  int num = 0, a, b;
  memset(visit, 0, sizeof(visit));
  while (q--) {
    cin >> a >> b;
    if (a == 1) {
      if (num < k) {
        visit[b - 1] = 1;
        online[num].cur = b - 1;
        online[num++].good = good[b - 1];
      } else {
        sort(online, online + n, judge);
        for (i = 0; i < num; i++) {
          if (good[b - 1] > online[i].good) {
            visit[online[i].cur] = 0;
            visit[b - 1] = 1;
            online[i].cur = b - 1;
            online[i].good = good[b - 1];
            break;
          }
        }
      }
    }
    if (a == 2) {
      if (visit[b - 1] == 1)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
