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;
template <class T>
inline bool fs(T &x) {
  int c = getchar();
  int sgn = 1;
  while (~c && c < '0' || c > '9') {
    if (c == '-') sgn = -1;
    c = getchar();
  }
  for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  x *= sgn;
  return ~c;
}
int sat(int n, int pos) { return n = n | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool cak(int n, int pos) { return (bool)(n & (1 << pos)); }
long long int binPow(long long int a, long long int q, long long int mud) {
  a %= mud;
  if (q == 0) return 1;
  return ((q % 2 == 1 ? a : 1) * binPow(a * a, q / 2, mud)) % mud;
}
map<int, bool> num;
vector<pair<int, int> > mara;
int ara[150000 + 5];
int main() {
  int n, k, q, x, y;
  fs(n);
  fs(k);
  fs(q);
  for (int i = 1; i < n + 1; i++) fs(ara[i]);
  for (int i = 0; i < q; i++) {
    fs(x);
    fs(y);
    if (x == 1) {
      mara.push_back(pair<int, int>(ara[y], y));
      int ln = mara.size();
      num[y] = true;
      if (ln == k + 1) {
        sort((mara).rbegin(), (mara).rend());
        num[mara[ln - 1].second] = false;
        mara.pop_back();
      }
    } else {
      if (num[y])
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
