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;
template <class T>
inline void read(T& num) {
  bool start = false, neg = false;
  char c;
  num = 0;
  while ((c = getchar()) != EOF) {
    if (c == '-')
      start = neg = true;
    else if (c >= '0' && c <= '9') {
      start = true;
      num = num * 10 + c - '0';
    } else if (start)
      break;
  }
  if (neg) num = -num;
}
const int maxn = 150005;
int A[maxn];
int B[maxn];
int tot, K;
inline void ins(int x) {
  int c = tot + 1;
  for (int i = (tot); i >= (1); i--)
    if (x > B[i]) c = i;
  for (int i = (tot); i >= (c); i--) B[i + 1] = B[i];
  B[c] = x;
  tot = min(tot + 1, K);
}
inline bool Find(int x) {
  for (int i = (1); i <= (tot); i++)
    if (B[i] == x) return 1;
  return 0;
}
int main() {
  int n, q;
  B[0] = (int)(1e9) + 10;
  read(n);
  read(K);
  read(q);
  for (int i = (1); i <= (n); i++) read(A[i]);
  for (int i = (1); i <= (q); i++) {
    int t, a;
    read(t);
    read(a);
    if (t == 1) {
      ins(A[a]);
    }
    if (t == 2) {
      if (Find(A[a]))
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
