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;
void solve(int test) {
  long long n, k, q;
  cin >> n >> k >> q;
  long long a[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<int> res;
  long long mini = -1;
  int vis[n + 1];
  memset(vis, 0, sizeof(vis));
  priority_queue<int, vector<int>, greater<int> > pq;
  while (q--) {
    int t, id;
    cin >> t >> id;
    if (t & 1) {
      vis[id] = 1;
      if (pq.size() < k) {
        pq.push(a[id]);
        continue;
      }
      if (a[id] > pq.top()) {
        pq.pop();
        pq.push(a[id]);
      }
    } else {
      if (!vis[id] || a[id] < pq.top())
        cout << "NO\n";
      else
        cout << "YES\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  int x = t;
  while (t--) {
    solve(x - t);
  }
  return 0;
}
