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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k, q;
  cin >> n >> k >> q;
  vector<long long> t(n, 0);
  map<long long, long long> c;
  for (long long i = 0; i < n; i++) {
    cin >> t[i];
    c[i + 1] = t[i];
  }
  vector<long long> temp;
  long long siz = min((long long)6, k);
  while (q--) {
    long long a, b;
    cin >> a >> b;
    sort(temp.begin(), temp.end());
    if (a == 1) {
      if (temp.size() < siz && !binary_search(temp.begin(), temp.end(), c[b])) {
        temp.push_back(c[b]);
      } else if (binary_search(temp.begin(), temp.end(), c[b]))
        continue;
      else {
        if (c[b] < temp[0]) continue;
        temp.erase(temp.begin());
        temp.push_back(c[b]);
      }
    } else if (a == 2) {
      if (binary_search(temp.begin(), temp.end(), c[b]))
        cout << "Yes\n";
      else
        cout << "No\n";
    }
  }
}
