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;
inline void readInt(int &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  x *= f;
}
inline void readLong(long long &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  x *= f;
}
int type, x, n, k, q, val[150010];
bool exist[150010];
priority_queue<int, vector<int>, greater<int> > Q;
map<int, int> pos;
int main() {
  readInt(n);
  readInt(k);
  readInt(q);
  for (int i = 1; i <= n; i++) {
    readInt(val[i]);
    pos[val[i]] = i;
  }
  while (q--) {
    readInt(type);
    readInt(x);
    if (type == 1) {
      if (Q.size() == k) {
        if (Q.top() < val[x]) {
          int now = Q.top();
          Q.pop();
          exist[pos[now]] = 0;
          exist[x] = 1;
          Q.push(val[x]);
        } else
          continue;
      } else {
        Q.push(val[x]);
        exist[x] = 1;
      }
    } else {
      if (exist[x])
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
