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;
typedef struct {
  int id;
  int fq;
} onl;
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  int arn[n + 1];
  for (int i = 1; i <= n; i++) cin >> arn[i];
  deque<onl> online;
  for (int i = 1; i <= q; i++) {
    int a, id;
    cin >> a >> id;
    if (a == 1) {
      onl temp;
      temp.id = id;
      temp.fq = arn[id];
      if (online.size() < k) {
        online.push_back(temp);
      } else {
        int min = temp.fq, ix = 0;
        for (int j = 0; j < online.size(); j++) {
          if (online.at(j).fq < min) {
            min = online.at(j).fq;
            ix = j;
          }
        }
        if (min != temp.fq) {
          online.at(ix) = temp;
        }
      }
    } else if (a == 2) {
      bool x = false;
      int k = 0;
      while (!x && k < online.size()) {
        if (online.at(k).id == id) x = true;
        k++;
      }
      if (x)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
