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 int in() {
  int res = 0;
  char c;
  int f = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') f = -1;
  while (c >= '0' && c <= '9') res = res * 10 + c - '0', c = getchar();
  return res * f;
}
const int N = 150010, MOD = 1e9 + 7;
pair<int, int> a[N];
multiset<pair<int, int> > s;
multiset<pair<int, int> >::iterator it;
int main() {
  int n = in(), k = in(), q = in();
  for (int i = 1; i <= n; i++) {
    a[i].first = in();
    a[i].second = i;
  }
  while (q--) {
    int x = in(), y = in();
    if (x == 1) {
      if (s.size() < k) {
        s.insert(pair<int, int>(a[y].first, y));
      } else {
        if (a[y].first > (*(s.begin())).first) {
          s.erase(s.begin());
          s.insert(pair<int, int>(a[y].first, y));
        }
      }
    } else {
      bool ok = 0;
      for (it = s.begin(); it != s.end(); it++) {
        if ((*it).second == y) {
          ok = 1;
          break;
        }
      }
      puts(ok ? "YES" : "NO");
    }
  }
  return 0;
}
