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;
struct my {
  long long u;
  int x;
  my();
  my(int a, int b) {
    u = a;
    x = b;
  }
  bool operator<(const my &p) const { return u > p.u; }
};
long long ara[1500010];
bool vis[1500010];
bool vis1[1500010];
priority_queue<my> source;
int n, k, q;
int func1(int a) {
  if (source.size() == k) {
    my m = source.top();
    if (m.u < ara[a]) {
      source.pop();
      my m1(ara[a], a);
      source.push(m1);
      vis[a] = 1;
      vis1[a] = 1;
      vis1[m.x] = 0;
    }
  } else {
    my m1(ara[a], a);
    source.push(m1);
    vis[a] = 1;
    vis1[a] = 1;
  }
}
int main() {
  while (cin >> n >> k >> q) {
    int id, a;
    for (int i = 1; i <= n; i++) cin >> ara[i];
    for (int i = 1; i <= q; i++) {
      cin >> id >> a;
      if (id == 1) {
        func1(a);
      } else {
        if (vis[a] == 1) {
          if (vis1[a] == 1)
            cout << "YES" << endl;
          else
            cout << "NO" << endl;
        } else {
          cout << "NO" << endl;
          func1(a);
        }
      }
    }
  }
}
