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;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int INF = 1000000000;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};
const int N = 150005;
int a[N];
int main() {
  ios_base::sync_with_stdio(0);
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<pair<int, int> > v;
  while (q--) {
    int x, y;
    cin >> x >> y;
    if (x == 1) {
      v.push_back(make_pair(a[y], y));
      sort((v).begin(), (v).end());
      reverse((v).begin(), (v).end());
      if (v.size() > k) {
        v.pop_back();
      }
    } else {
      bool ok = 0;
      for (int i = 0; i < min((int)v.size(), k); i++) {
        if (v[i].second == y) {
          ok = 1;
        }
      }
      if (ok) {
        cout << "YES\n";
      } else {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
