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;
int main() {
  int n, k, q;
  int qt, id;
  int t[150000];
  unordered_set<int> isOnline;
  set<int, greater<int>> online;
  set<int>::iterator it;
  int curmn = (int)1e9, curmx = 0;
  int num = 0;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) cin >> t[i];
  while (q--) {
    cin >> qt >> id;
    if (qt == 1) {
      isOnline.insert(id);
      if (isOnline.size() == 1) {
        curmn = curmx = t[id - 1];
        online.insert(t[id - 1]);
        num++;
        continue;
      }
      if (t[id - 1] > curmx) {
        curmx = t[id - 1];
        if (num < k) {
          online.insert(t[id - 1]);
          num++;
        } else {
          online.insert(t[id - 1]);
          it = online.end();
          it--;
          online.erase(it);
          it = online.end();
          it--;
          curmn = *it;
        }
      } else if (t[id - 1] < curmn) {
        if (num < k) {
          num++;
          online.insert(t[id - 1]);
          curmn = t[id - 1];
        }
      } else {
        if (num < k) {
          online.insert(t[id - 1]);
          num++;
        } else {
          online.insert(t[id - 1]);
          it = online.end();
          it--;
          online.erase(it);
          it = online.end();
          it--;
          curmn = *it;
        }
      }
    } else if (qt == 2) {
      if (isOnline.find(id) != isOnline.end()) {
        if (t[id - 1] < curmn)
          cout << "NO" << endl;
        else
          cout << "YES" << endl;
      } else
        cout << "NO" << endl;
    }
  }
}
