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;
bool check(int cc, int searsh);
int love[150100];
pair<int, int> p[150100];
int n, k, q, type, id;
int main() {
  ios_base::sync_with_stdio(0);
  int cc = 0;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> love[i];
  for (int i = 0; i < q; i++) {
    cin >> type >> id;
    if (type == 1) {
      if (cc < 6) {
        p[cc].first = love[id];
        p[cc].second = id;
        cc++;
      } else {
        sort(p, p + cc);
        p[0].first = love[id];
        p[0].second = id;
      }
    }
    if (type == 2) {
      if (check(cc, id))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
bool check(int cc, int searsh) {
  bool found = false;
  sort(p, p + cc);
  for (int i = cc - 1; i > cc - k - 1 && i >= 0; i--) {
    if (p[i].second == searsh) found = true;
  }
  return found;
}
