#include <bits/stdc++.h>
using namespace std;
long long a[150005];
int mark[150005];
set<long long> s;
set<long long>::iterator it;
int main() {
  int n, q, k;
  cin >> n >> k >> q;
  int i;
  for (i = 0; i < n; i++) cin >> a[i];
  long long typ, val, x;
  while (q--) {
    cin >> typ >> val;
    if (typ == 1) {
      mark[val] = 1;
      x = a[val - 1];
      if (s.size() < k)
        s.insert(x);
      else {
        it = s.begin();
        long long val1 = *it;
        if (val1 < x) {
          s.erase(it);
          s.insert(x);
        }
      }
    } else {
      if (mark[val]) {
        x = a[val - 1];
        it = s.find(x);
        if (it != s.end())
          printf("YES\n");
        else
          printf("NO\n");
      } else {
        printf("NO\n");
      }
    }
  }
  return 0;
}
