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 long int n, k, q;
  scanf("%lli %lli %lli", &n, &k, &q);
  long long int arr[n], arr1[k + 1];
  long long int i;
  for (i = 0; i < n; i++) {
    scanf("%lli", &arr[i]);
  }
  long long int ty, id, j = 0, finds, found = 0;
  j = k;
  while (j) {
    arr1[j--] = 0;
  }
  while (q--) {
    scanf("%lli %lli", &ty, &id);
    if (ty == 1) {
      if (j < k) {
        arr1[k - j] = arr[id - 1];
        sort(arr1, arr1 + k);
        j++;
      } else {
        arr1[0] = arr[id - 1];
        sort(arr1, arr1 + k);
      }
    } else {
      finds = arr[id - 1];
      found = 0;
      for (i = 1; i <= k; i++) {
        if (arr1[i] == finds) {
          found = 1;
        }
      }
      if (found)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
}
