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;
vector<pair<int, int> > v;
bool act[1000006];
int arr[1000006];
int main() {
  int n, q, k;
  scanf("%d", &n);
  scanf("%d", &k);
  scanf("%d", &q);
  for (int i = 1; i <= (n); i++) scanf("%d", &arr[i]);
  for (int x = 1; x <= (q); x++) {
    int m1, a1;
    scanf("%d", &m1);
    scanf("%d", &a1);
    if (m1 == 1) {
      act[a1] = true;
      v.push_back(make_pair(arr[a1], a1));
      if (v.size() > k) {
        sort(v.begin(), v.end(), greater<pair<int, int> >());
        act[v[v.size() - 1].second] = false;
        v.pop_back();
      }
    } else {
      if (act[a1])
        cout << "YES";
      else
        cout << "NO";
      printf("\n");
    }
  }
  return 0;
}
