#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long int n, q, k;
  cin >> n >> k >> q;
  vector<long long int> v1;
  long long int array[n + 1];
  long long int status[n + 1];
  for (long long int j = 0; j < n + 1; j++) {
    status[j] = 0;
  }
  map<long long int, long long int> m2;
  for (long long int i = 1; i <= n; i++) {
    cin >> array[i];
    m2[array[i]] = i;
  }
  for (long long int j = 1; j <= q; j++) {
    long long int a, b;
    cin >> a >> b;
    if (a == 1) {
      if (v1.size() < k) {
        v1.push_back(array[b]);
      } else if (v1.size() >= k) {
        sort(v1.begin(), v1.end());
        if (v1[0] > array[b]) {
        } else {
          reverse(v1.begin(), v1.end());
          v1.pop_back();
          v1.push_back(array[b]);
        }
      }
    } else {
      long long int count = 0;
      for (long long int i = 0; i < v1.size(); i++) {
        if (m2[v1[i]] == b) {
          cout << "YES\n";
          count = 1;
          break;
        }
      }
      if (count == 0) {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
