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;
long long big = 1000000007ll;
long long n, m, k, q, d;
int main() {
  long long c1, c2, c3, c4, c5, c6;
  long long x, y, z;
  long long a, b, c, e;
  std::cin >> n >> k >> q;
  std::vector<long long> T;
  std::priority_queue<long long> PQ;
  std::vector<long long> mark;
  std::map<long long, long long> M;
  for (c1 = 0; c1 < n; c1++) {
    std::cin >> a;
    T.push_back(a);
    M[a] = c1;
    mark.push_back(0);
  }
  for (c1 = 0; c1 < q; c1++) {
    std::cin >> a >> b;
    b--;
    if (a == 2) {
      if (mark[b] == 1) {
        std::cout << "YES\n";
      } else {
        std::cout << "NO\n";
      }
    } else {
      if (PQ.empty()) {
        PQ.push(-T[b]);
        mark[b] = 1;
      } else {
        if (-PQ.top() > -T[b]) {
          PQ.push(-T[b]);
          mark[b] = 1;
          if (PQ.size() > k) {
            c2 = -PQ.top();
            PQ.pop();
            mark[M[c2]] = 0;
          }
        }
      }
    }
  }
  return 0;
}
