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 double PI = acos(-1.0);
const double EPS = 1e-10;
inline int read() {
  static char ch;
  bool sgn = false;
  while (ch = getchar(), ch < '0' || ch > '9')
    if (ch == '-') sgn = true;
  int res = ch - 48;
  while (ch = getchar(), ch >= '0' && ch <= '9') res = res * 10 + ch - 48;
  return sgn ? -res : res;
}
const int N = 2e5 + 5;
int n, q, k, t[N], a[10], tot;
bool bo[N];
bool cmp(int i, int j) { return t[i] < t[j]; }
int main() {
  n = read(), k = read(), q = read();
  for (int i = 1; i <= n; i++) t[i] = read();
  while (q--) {
    int p = read(), x = read();
    if (p == 1) {
      if (tot < k) {
        tot++;
        a[tot] = x;
        bo[x] = 1;
      } else {
        sort(a + 1, a + 1 + k, cmp);
        if (t[x] > t[a[1]]) {
          bo[a[1]] = 0;
          a[1] = x;
          bo[x] = 1;
        }
      }
    } else {
      if (bo[x])
        puts("YES");
      else
        puts("NO");
    }
  }
}
