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;
bool f1(const std::pair<int, int>& l, const std::pair<int, int>& r) {
  return l.first > r.first;
}
long long gcd(long long a, long long b) {
  if (a > b) {
    if (b == 0) return a;
    return gcd(b, a % b);
  }
  if (a == 0) return b;
  return gcd(a % b, a);
}
int main() {
  long long n, k, q;
  cin >> n >> k >> q;
  priority_queue<long long> heap;
  priority_queue<long long> heap2;
  if (k > 6) k = 6;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long flag = 0;
  for (int i = 0; i < q; i++) {
    flag = 0;
    long long u, v;
    cin >> u >> v;
    if (u == 1)
      heap.push(-1 * a[v]);
    else if (u == 2) {
      heap2 = heap;
      if (heap.empty())
        cout << "NO" << endl;
      else {
        for (int j = 0; j < k && !flag && !heap2.empty(); j++) {
          long long temp = heap2.top();
          if (temp == -1 * a[v]) {
            cout << "YES" << endl;
            flag = 1;
          }
          heap2.pop();
        }
        if (!flag) cout << "NO" << endl;
      }
    }
  }
  return 0;
}
