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;
struct fr {
  int id;
  int t;
};
vector<fr> window;
int n, k, q;
int find_min() {
  if (window.size() < k) return -1;
  int min_id, min_t = INT_MAX;
  for (int i = 0; i < window.size(); i++) {
    if (window[i].t < min_t) {
      min_t = window[i].t;
      min_id = window[i].id;
    }
  }
  return min_id;
}
int main() {
  cin >> n >> k >> q;
  vector<int> friends;
  for (int i = 0; i < n; i++) {
    int temp;
    scanf("%d", &temp);
    friends.push_back(temp);
  }
  while (q > 0) {
    int id, type;
    scanf("%d%d", &type, &id);
    if (type == 1) {
      fr temp;
      temp.id = id - 1;
      temp.t = friends[temp.id];
      int min_id = find_min();
      if (min_id < 0)
        window.push_back(temp);
      else {
        if (friends[min_id] > temp.t) {
          continue;
          q--;
        }
        for (int j = 0; j < window.size(); j++)
          if (window[j].id == min_id) window[j] = temp;
      }
    } else if (type == 2) {
      bool yes = false;
      for (int j = 0; j < window.size(); j++)
        if (window[j].id == id - 1) yes = true;
      if (yes)
        printf("YES\n");
      else
        printf("NO\n");
    }
    q--;
  }
  return 0;
}
