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;
  cin >> n >> k >> q;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  long long int dis[k];
  for (long long int i = 0; i < k; i++) dis[i] = 0;
  long long int b[q], j = 0;
  for (long long int i = 0; i < q; i++) {
    long long int ty, id;
    sort(dis, dis + k);
    cin >> ty >> id;
    if (ty == 1) {
      int y = 0;
      for (long long int l = 0; l < k; l++) {
        if (dis[l] == a[id - 1]) y = 1;
        break;
      }
      if (y == 0) dis[0] = a[id - 1];
    } else if (ty == 2) {
      int t = 0;
      for (long long int l = 0; l < k; l++) {
        if (dis[l] == a[id - 1]) {
          t = 1;
          b[j] = 1;
          break;
        }
      }
      if (t == 0) {
        b[j] = 0;
      }
      ++j;
    }
  }
  for (long long int i = 0; i < j; i++) {
    if (b[i] == 1)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
