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;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const long long MAXN = 2e5 + 7;
const long long MAXM = 1e5 + 7;
const long long MOD = 1e9 + 7;
const double eps = 1e-6;
const double pi = acos(-1.0);
struct node {
  int t, id, onl;
  friend bool operator<(const node a, const node b) { return a.t > b.t; }
} fr[MAXN];
map<int, int> mp;
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++)
    scanf("%d", &fr[i].t), fr[i].id = i, fr[i].onl = 0;
  priority_queue<node> pq;
  while (q--) {
    int op, id;
    scanf("%d%d", &op, &id);
    if (op == 1) {
      fr[id].onl = 1;
      pq.push(fr[id]);
      while (pq.size() > k) pq.pop();
    } else {
      bool flag = false;
      priority_queue<node> temp = pq;
      while (!temp.empty()) {
        if (temp.top().id == id) {
          flag = true;
          break;
        }
        temp.pop();
      }
      if (flag)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
