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;
int next_int() {
  int v = 0, c, s = 1, l = 0;
  while (c = getchar()) {
    if (c == '-')
      s = -1;
    else if (c >= '0')
      v = v * 10 + c - '0', l++;
    else if (l)
      break;
  }
  return v * s;
}
int main() {
  set<int> online;
  int n = next_int(), k = next_int(), q = next_int();
  int arr[n];
  for (int i = 0; i < n; i++) arr[i] = next_int();
  for (int i = 0; i < q; i++) {
    int type = next_int(), id = next_int() - 1;
    if (type == 1) {
      online.insert(arr[id]);
      while (online.size() > k) online.erase(online.begin());
    } else {
      if (online.find(arr[id]) == online.end())
        printf("NO\n");
      else
        printf("YES\n");
    }
  }
  return 0;
}
