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>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:666000000")
using namespace std;
const int INF = (1 << 30) - 1;
const long double EPS = 1e-9;
void ML(const bool v) {
  if (v) return;
  int *ass;
  for (;;) {
    ass = new int[2500000];
    for (int i = 0; i < 2500000; i++) ass[i] = rand();
  }
}
void TL(const bool v) {
  if (v) return;
  for (;;) cout << rand() % (rand() % 1000 + 1) << endl;
}
void PE(const bool v) {
  if (v) return;
  for (int i = 0; i < 10000; i++) printf("%c", rand() % 256);
  exit(0);
}
int n, k, m;
vector<pair<int, int> > a;
bool LoAd() {
  if (!(3 == scanf("%d%d%d", &n, &k, &m))) return false;
  a.resize(n);
  for (int i = 0; i < (int)(n); i++) {
    (1 == scanf("%d", &a[i].first));
    a[i].first *= -1;
    a[i].second = i + 1;
  }
  return true;
}
void SoLvE() {
  set<pair<int, int> > w;
  for (int tp, id, i = 0; i < m; i++) {
    (2 == scanf("%d%d", &tp, &id));
    if (1 == tp) {
      w.insert(a[id - 1]);
      if ((int)w.size() > k) {
        w.erase(*w.rbegin());
      }
    } else if (2 == tp) {
      if (w.count(a[id - 1]) == 1)
        puts("YES");
      else
        puts("NO");
    }
  }
  puts("");
}
int main() {
  srand((int)time(NULL));
  LoAd();
  SoLvE();
  return 0;
}
