#include <bits/stdc++.h>
using namespace std;
int n, k, q;
int a, b;
int val[150000 + 7];
map<int, int> m;
int main() {
  cin >> n >> k >> q;
  map<int, int>::iterator it;
  for (int i = 1; i <= n; i += 1) scanf("%d", &val[i]);
  for (int i = 0; i < q; i += 1) {
    scanf("%d%d", &a, &b);
    if (a == 1) {
      if (m.size() == k) {
        it = m.begin();
        if ((*it).first < val[b]) {
          m.erase(it);
          m[val[b]] = b;
        }
      } else {
        m[val[b]] = b;
      }
    } else if (a == 2) {
      if (m.find(val[b]) != m.end())
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
