#include <bits/stdc++.h>
using namespace std;
long long n, k, q;
void f1(long long x, pair<long long, long long> *ko, long long *zn) {
  if (zn[x] >= ko[0].first) {
    ko[0].second = x;
    ko[0].first = zn[x];
  }
  sort(ko, ko + k);
}
bool f2(long long x, pair<long long, long long> *ko) {
  for (long long i = 0; i < k; ++i) {
    if (ko[i].second == x) {
      return true;
      break;
    } else if (i == k - 1) {
      return false;
    }
  }
}
int main() {
  cin >> n >> k >> q;
  pair<long long, long long> ko[k];
  long long koi[k];
  long long zn[n];
  vector<bool> u;
  for (long long i = 0; i < n; ++i) {
    cin >> zn[i];
  }
  for (long long j = 0; j < k; ++j) {
    ko[j].first = -1;
    ko[j].second = -1;
  }
  long long a;
  for (long long i = 0; i < q; ++i) {
    cin >> a;
    if (a == 1) {
      cin >> a;
      a--;
      f1(a, ko, zn);
    } else {
      cin >> a;
      a--;
      u.push_back(f2(a, ko));
    }
  }
  for (long long i = 0; i < (long long)(u.size()); ++i) {
    if (u[i] == true)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
