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 comment(linker, "/STGCK:66777216")
using namespace std;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)2e9 + 7;
const long long LINF = (long long)8e18;
const long long MM = (long long)1e9 + 7;
const int MAXN = (int)1e3 + 7;
int solve();
int main() {
  solve();
  return 0;
}
vector<int> G;
int solve() {
  int n, k, q;
  scanf("%d %d %d", &n, &k, &q);
  G.resize(n);
  for (int i = 0; i < (int)n; i++) {
    scanf("%d", &G[i]);
  }
  set<pair<int, int> > S;
  while (q--) {
    int w, id;
    scanf("%d %d", &w, &id);
    if (w == 1) {
      S.insert(make_pair(G[id - 1], id - 1));
      if (k < S.size()) S.erase(S.begin());
    } else {
      bool ok = false;
      for (auto it : S)
        if (it.second == id - 1) {
          ok = true;
        }
      puts(ok ? "YES" : "NO");
    }
  }
  return 0;
}
