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;
void solve() {
  int n, k, q;
  cin >> n >> k >> q;
  map<int, int> mp;
  priority_queue<pair<int, int>> pq;
  for (int i = 0; i < n; i++) {
    int z;
    cin >> z;
    mp[i + 1] = z;
  }
  for (int i = 0; i < q; i++) {
    int a, b;
    cin >> a >> b;
    if (a == 1) {
      pq.push({mp[b], b});
    }
    if (a == 2) {
      int f = 0;
      vector<pair<int, int>> vtemp;
      int tk = k;
      while (tk-- and !pq.empty()) {
        auto ptr = pq.top();
        if (ptr.second == b) {
          f = 1;
          cout << "YES\n";
          break;
        }
        pq.pop();
        vtemp.push_back(ptr);
      }
      for (auto i : vtemp) {
        pq.push(i);
      }
      vtemp.clear();
      if (f == 0) {
        cout << "NO\n";
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
