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 dx[] = {0, 1, -1, 0};
int dy[] = {1, 0, 0, -1};
long double PI = 3.14159265358979323846264338327950;
bool online[200005];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, k, q;
  cin >> n >> k >> q;
  map<int, int> mp;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    mp[i + 1] = x;
  }
  int c = 0;
  vector<pair<int, int> > v;
  while (q--) {
    int a, b;
    cin >> a >> b;
    if (a == 1) {
      if (c == k) {
        c = 0;
        v.push_back({mp[b], b});
        sort(v.begin(), v.end());
        memset(online, 0, sizeof online);
        int idx = (int)v.size() - 1;
        for (int i = 0; i < k; i++) {
          online[v[idx--].second] = 1;
        }
      } else {
        online[b] = 1;
      }
      c++;
      v.push_back({mp[b], b});
    } else {
      cout << (online[b] ? "YES\n" : "NO\n");
    }
  }
  return 0;
}
