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 a[150010];
int sco[150010];
int onl[151001];
int main(int argc, char const *argv[]) {
  int n, k, q;
  cin >> n >> k >> q;
  priority_queue<pair<int, int>, vector<pair<int, int> >,
                 greater<pair<int, int> > >
      que;
  for (int i = 1; i <= n; ++i) {
    cin >> sco[i];
  }
  int ans = 0;
  for (int i = 0; i < q; ++i) {
    int t, num;
    cin >> t >> num;
    if (t == 1) ans++;
    pair<int, int> pa;
    if (onl[num] == 0 && t == 1) {
      pa.first = sco[num];
      pa.second = num;
      que.push(pa);
    }
    if (ans > k) {
      pair<int, int> pb;
      pb = que.top();
      int j = pb.second;
      onl[j] = 0;
      que.pop();
      ans--;
    }
    if (t == 1) {
      onl[num] = 1;
    }
    if (t == 2) {
      if (onl[num] == 0) {
        printf("NO\n");
      } else {
        printf("YES\n");
      }
    }
  }
  return 0;
}
