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 EPS = 1e-8;
int n, k, q, id, op;
int arr[200000];
int ff[200000];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    ff[i] = arr[i];
  }
  queue<int> cola;
  queue<int> auxi;
  while (q--) {
    cin >> op >> id;
    if (op == 2) {
      bool ok = false;
      while (!cola.empty()) {
        int u = cola.front();
        cola.pop();
        if (u == id) ok = true;
        auxi.push(u);
      }
      while (!auxi.empty()) {
        cola.push(auxi.front());
        auxi.pop();
      }
      if (ok) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
    } else {
      if (cola.size() < k) {
        cola.push(id);
      } else {
        int idd = 0;
        int mini = INT_MAX;
        while (!cola.empty()) {
          int u = cola.front();
          cola.pop();
          if (ff[u] < mini) {
            mini = ff[u];
            idd = u;
          }
          auxi.push(u);
        }
        while (!auxi.empty()) {
          int u = auxi.front();
          auxi.pop();
          if (u != idd) {
            cola.push(u);
          }
        }
        cola.push(id);
      }
    }
  }
  return 0;
}
