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 t[1000001];
map<int, int> mp;
int ke[10], d[10];
int main() {
  int n, k, q, pos, x;
  cin >> n >> k >> q;
  for (long long int i = 0; i < n; ++i) {
    cin >> t[i];
    mp[t[i]] = i;
  }
  int mi;
  for (long long int i = 0; i < q; ++i) {
    int ty, id;
    cin >> ty >> id;
    id--;
    if (ty == 1) {
      int bo = 0;
      for (long long int i = 0; i < k; ++i) {
        if (ke[i] == 0) {
          ke[i] = t[id];
          goto hell;
        }
      }
      for (long long int i = 0; i < k; ++i) {
        if (ke[i] < t[id]) bo = 1;
      }
      if (bo == 0) {
        goto hell;
      }
      x = ke[0];
      pos = 0;
      for (long long int i = 0; i < k; ++i) {
        if (x > ke[i]) {
          pos = i;
          x = ke[i];
        }
      }
      ke[pos] = t[id];
    hell:;
    }
    if (ty == 2) {
      int bo = 0;
      for (long long int i = 0; i < k; ++i) {
        if (t[id] == ke[i]) bo = 1;
      }
      if (bo == 0) {
        cout << "NO" << endl;
      } else
        cout << "YES" << endl;
    }
  }
}
