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 main() {
  int n, q, k;
  scanf("%d%d%d", &n, &k, &q);
  map<int, int> m;
  vector<pair<int, int>> ss;
  map<int, int> v;
  for (int i = 1; i <= n; i++) {
    int a;
    scanf("%d", &a);
    m[a] = i;
    v[i] = a;
  }
  int cnt = 0;
  set<int> s;
  while (q--) {
    int a, b;
    scanf("%d %d", &a, &b);
    if (a == 1) {
      s.insert(-v[b]);
      cnt++;
    } else if (a == 2) {
      bool f = false;
      if (cnt > k) cnt = k;
      set<int>::iterator it = s.begin();
      int t = cnt;
      while (t--) {
        int c = *it;
        if (m[-c] == b) {
          f = true;
          break;
        }
        it++;
      }
      if (f)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
