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>
const int INF = 0x7F7F7F7F;
const double EPS = 1e-10;
const long long mod7 = 1e9 + 7;
const long long mod9 = 1e9 + 9;
using namespace std;
inline long long rit() {
  long long f = 0, key = 1;
  char c;
  do {
    c = getchar();
    if (c == '-') key = -1;
  } while (c < '0' || c > '9');
  do {
    f = f * 10 + c - '0';
    c = getchar();
  } while (c >= '0' && c <= '9');
  return f * key;
}
inline void fprt(double f) { printf("%.08lf", f); }
void init() {}
const int Z = 150005;
int n, k, q;
int a[Z], stk[10];
void read() {
  n = rit(), k = rit(), q = rit();
  ;
  for (int i = 1; i <= n; i++) a[i] = rit();
  ;
}
void solve() {
  int tag, x;
  int j;
  for (int i = 0; i < q; i++) {
    tag = rit(), x = rit();
    ;
    if (tag == 1) {
      for (j = 0; j < min(i, k); j++)
        if (a[stk[j]] < a[x]) break;
      tag = j;
      for (j = min(i, k); j > tag; j--) stk[j] = stk[j - 1];
      stk[tag] = x;
    } else {
      for (j = 0; j < min(i, k); j++) {
        if (stk[j] == x) {
          cout << "YES" << endl;
          break;
        }
      }
      if (j == min(i, k)) cout << "NO" << endl;
    }
  }
}
int main() {
  int nn = 1;
  while (nn--) {
    init(), read(), solve();
  }
  return 0;
}
