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 n, k, q, cs = 0;
int a[160000], b[160000], c[10];
void process(int f) {
  cs++;
  int tam = cs - 1;
  b[cs] = f;
  if (tam > 0)
    if (a[b[tam]] < a[f]) {
      b[tam + 1] = b[tam];
      c[b[tam]]++;
      b[tam] = f;
      tam--;
    }
  c[f] = tam + 1;
  if (cs >= k + 1) cs = k + 1;
}
void process2(int f) {
  if (c[f] == 0) {
    cout << "NO" << endl;
    return;
  }
  if (c[f] <= k) {
    cout << "YES" << endl;
  } else
    cout << "NO" << endl;
}
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  int t, f;
  for (int i = 1; i <= q; i++) {
    cin >> t >> f;
    if (c[f] == 0)
      if (t == 1)
        process(f);
      else
        process2(f);
  }
  return 0;
}
