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>
#pragma comment(linker, "/STACK:16777216")
#pragma warning(disable : 4786)
using namespace std;
string to_string(long long x) {
  stringstream ss;
  ss << x;
  return ss.str();
}
long long to_int(const string &s) {
  stringstream ss;
  ss << s;
  long long x;
  ss >> x;
  return x;
}
struct frnd {
  int id;
  int power;
  frnd(int i, int p) {
    id = i;
    power = p;
  }
};
int pw[150001];
bool operator<(const frnd &a, const frnd &b) { return a.power < b.power; }
int main(void) {
  int n, k, q, i, j;
  int c, d;
  while (cin >> n >> k >> q) {
    priority_queue<frnd> pq;
    for (i = 1; i < n + 1; i++) {
      cin >> pw[i];
    }
    for (i = 0; i < q; i++) {
      cin >> c >> d;
      if (c == 1) {
        pq.push(frnd(d, pw[d]));
      } else {
        bool ok = false;
        int st = d;
        int cnt = k;
        vector<frnd> vf;
        while (cnt && !pq.empty()) {
          frnd t = pq.top();
          pq.pop();
          vf.push_back(t);
          if (t.id == st) {
            ok = true;
            break;
          }
          cnt--;
        }
        if (ok) {
          cout << "YES\n";
        } else {
          cout << "NO\n";
        }
        int sz = vf.size();
        for (j = 0; j < sz; j++) {
          pq.push(vf[j]);
        }
      }
    }
  }
  return 0;
}
