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 int N = 150100;
struct cmp {
  bool operator()(pair<int, int> a, pair<int, int> b) {
    return (a.first < b.first);
  }
};
priority_queue<pair<int, int>, vector<pair<int, int> >, cmp> pq;
pair<int, int> a[N];
int n, q, k;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  int arr[10], dem;
  for (int i = 1; i <= q; i++) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      pq.push(a[id]);
    } else {
      dem = 0;
      int ok = 0;
      while (pq.size() != 0 && dem < k) {
        pair<int, int> p = pq.top();
        pq.pop();
        arr[++dem] = p.second;
        if (p.second == id) {
          cout << "YES" << endl;
          ok = 1;
          break;
        }
      }
      if (!ok) cout << "NO" << endl;
      for (int i = 1; i <= dem; i++) pq.push(a[arr[i]]);
    }
  }
  return 0;
}
