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;
  cin >> n >> k >> q;
  vector<int> vec(n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &vec[i]);
  }
  vector<int> fr(k, -1);
  for (int i = 0; i < q; ++i) {
    static int t, f;
    scanf("%d %d", &t, &f);
    f -= 1;
    if (t == 1) {
      for (int ii = 0; ii < k; ++ii) {
        if (fr[ii] < vec[f]) {
          for (int i2 = k - 1; i2 > ii; --i2) {
            fr[i2] = fr[i2 - 1];
          }
          fr[ii] = vec[f];
          break;
        }
      }
    } else {
      bool yes = false;
      for (int ii = 0; ii < k && !yes; ++ii) {
        yes |= (vec[f] == fr[ii]);
      }
      printf("%s\n", yes ? "YES" : "NO");
    }
  }
  return 0;
}
