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 a[150003], poz[10], fk[10], n, p, k, q, x, y, i, L;
bool ok;
int main() {
  cin >> n >> k >> q;
  for (i = 1; i <= k; ++i) fk[i] = -1;
  for (i = 1; i <= n; ++i) cin >> a[i];
  while (q--) {
    cin >> x >> y;
    if (x == 2) {
      ok = 0;
      for (i = 1; i <= k; ++i)
        if (poz[i] == y) ok = 1;
      if (ok)
        cout << "YES\n";
      else
        cout << "NO\n";
    } else {
      ok = 1;
      for (i = 1; i <= k && ok; ++i)
        if (fk[i] == -1) {
          ok = 0;
          fk[i] = a[y];
          poz[i] = y;
        }
      if (ok) {
        int mn = fk[1], L = 1;
        for (i = 2; i <= k; ++i) {
          if (fk[i] < mn) {
            mn = fk[i];
            L = i;
          }
        }
        if (a[y] > mn) {
          fk[L] = a[y];
          poz[L] = y;
        }
      }
    }
  }
  return 0;
}
