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;
void IO() {
  ios::sync_with_stdio(0);
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
}
bool Isdisplayed(long long arr[], long long key);
int main() {
  IO();
  long long n, k, q, t[200000], id, Min = 0;
  short int type;
  cin >> n >> k >> q;
  long long *displayed = (long long *)calloc(k, sizeof(long long));
  for (long long i = 0; i < n; i++) {
    cin >> t[i];
  }
  for (long long i = 0; i < q; i++) {
    cin >> type >> id;
    Min = displayed[0];
    if (type == 1) {
      if (t[id - 1] > Min) {
        displayed[0] = t[id - 1];
      }
      sort(displayed, displayed + k);
    } else if (type == 2) {
      bool b = false;
      b = Isdisplayed(displayed, t[id - 1]);
      if (b == true)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
bool Isdisplayed(long long arr[], long long key) {
  for (short int i = 0; i < 6; i++) {
    if (arr[i] == key) return true;
  }
  return false;
}
