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() {
  long num_of_friends, okno, requests;
  cin >> num_of_friends >> okno >> requests;
  long *friend_points = new long[num_of_friends + 1];
  long *friend_use = new long[num_of_friends];
  long *list = new long[okno];
  for (long i = 0; i <= num_of_friends - 1; i++) {
    cin >> friend_points[i];
  }
  friend_points[num_of_friends] = 0;
  for (long i = 0; i <= okno - 1; i++) {
    list[i] = num_of_friends;
  }
  for (long i = 1; i <= requests; i++) {
    long code, id;
    cin >> code >> id;
    if (code == 1) {
      if (friend_points[id] > list[okno - 1]) {
        friend_use[id] = true;
        friend_use[okno - 1] = false;
        long j = okno - 2;
        while (friend_points[id] > friend_points[j] && j >= 0) {
          list[j + 1] = list[j];
          j--;
        }
        list[j + 1] = id;
      } else
        continue;
    } else {
      if (friend_use[id] == true)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
