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;
long long ar[150100];
long long N, K, Q;
pair<long long, long long> best[7];
int main(void) {
  memset(best, 0, sizeof(best));
  cin >> N >> K >> Q;
  for (long long i = 1; i <= N; i++) {
    cin >> ar[i];
  }
  for (long long i = 0; i < Q; i++) {
    long long a, b;
    cin >> a >> b;
    if (a == 1) {
      long long val = ar[b];
      long long mn = 20000000000;
      long long mnum = 0;
      for (long long j = 1; j <= K; j++) {
        if (best[j].first < mn) {
          mn = best[j].first;
          mnum = j;
        }
      }
      if (val > mn) {
        best[mnum].first = val;
        best[mnum].second = b;
      }
    }
    if (a == 2) {
      long long f = 0;
      for (long long j = 1; j <= K; j++) {
        if (best[j].second == b) f = 1;
      }
      if (f == 1)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
