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, high, low, mid, i, j, ch, f, count1 = 0;
  scanf("%d%d%d", &n, &k, &q);
  long long int a[n], c[n];
  char b[n];
  for (i = 0; i < n; i++) b[i] = 'b';
  for (i = 0; i < n; i++) {
    scanf("%I64d", &a[i]);
    a[i] = c[i];
  }
  sort(c, c + n);
  for (i = 0; i < q; i++) {
    scanf("%d%d", &ch, &f);
    if (ch == 1) {
      b[f - 1] = 'a';
      count1++;
    } else {
      if (count1 < k && b[f - 1] == 'a')
        printf("YES\n");
      else if (b[f - 1] != 'a')
        printf("NO\n");
      else if (count1 >= k) {
        for (low = 0, high = n - 1; low <= high;) {
          mid = (high + low) / 2;
          if (a[f - 1] > c[mid])
            low = mid + 1;
          else if (a[f - 1] < c[mid])
            high = mid - 1;
          else {
            j = mid + 1;
            break;
          }
        }
        if (j <= k)
          printf("YES\n");
        else
          printf("NO\n");
      }
    }
  }
  return 0;
}
