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;
const int INF = 1e9;
const int N = 1000000;
struct point {
  int x;
  int y;
  bool operator<(const point &e) const { return x < e.x; }
} p[N];
int n, k, m;
int a[N], in[N];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
    q;
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> k >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) {
    int tp, id;
    cin >> tp >> id;
    if (tp == 1) {
      if (q.size() < k) {
        in[id] = 1;
        q.push({a[id], id});
      } else {
        auto top = q.top();
        if (top.first < a[id]) {
          in[top.second] = 0;
          in[id] = 1;
          q.pop();
          q.push({a[id], id});
        }
      }
    } else {
      if (in[id])
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
