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 par[100005] = {0};
void make_parent(int n) {
  for (int i = 1; i <= n; i++) par[i] = i;
}
int find(int x) {
  if (par[x] == x)
    return x;
  else
    return find(par[x]);
}
int uni(int x, int y) {
  int u = find(x);
  int v = find(y);
  if (u == v)
    return 1;
  else
    par[u] = v;
}
int main() {
  long long n, k, q;
  while (cin >> n >> k >> q) {
    vector<pair<long long, long long> > vc;
    map<long long, long long> mp;
    long long t[150005];
    for (int i = 1; i <= n; i++) cin >> t[i];
    long long type, index, p = 0;
    for (int i = 1; i <= q; i++) {
      cin >> type >> index;
      if (type == 1) {
        vc.push_back(make_pair(t[index], index));
        mp[index] = 1;
        p++;
        if (p > k) {
          sort(vc.begin(), vc.end());
          p--;
          index = vc[0].second;
          mp[index] = 0;
        }
      } else {
        if (mp[index] == 1)
          cout << "YES\n";
        else
          cout << "NO\n";
      }
    }
  }
}
