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 n, k, q, x, y, o, a[500000];
pair<int, int> b[500];
bool was;
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= q; i++) {
    cin >> x >> y;
    if (x == 1) {
      if (o < k) {
        o++;
        b[o].first = a[y];
        b[o].second = y;
        sort(b + 1, b + 1 + o);
        reverse(b + 1, b + 1 + o);
      } else {
        b[k + 1].first = a[y];
        b[k + 1].second = y;
        sort(b + 1, b + k + 2);
        reverse(b + 1, b + k + 2);
      }
    } else {
      was = false;
      for (int j = 1; j <= k; j++)
        if (b[j].second == y) {
          cout << "YES\n";
          was = true;
        }
      if (!was) cout << "NO\n";
    }
  }
  return 0;
}
