#include <bits/stdc++.h>
const long long int mod = 1e9 + 7;
using namespace std;
int main() {
  int n, k, q;
  scanf("%d", &n);
  ;
  scanf("%d", &k);
  ;
  scanf("%d", &q);
  ;
  int t[n + 1];
  map<int, int> mp;
  for (int i = 0; i < n; i++) {
    scanf("%d", &t[i]);
    ;
  }
  bool check[n + 2];
  memset(check, false, sizeof(check));
  ;
  int checker = 0;
  while (q--) {
    int id, fri;
    scanf("%d", &id);
    ;
    scanf("%d", &fri);
    ;
    if (id == 1) {
      if (checker < k) {
        check[fri] = true;
        mp[t[fri - 1]] = fri;
        checker++;
      } else {
        check[fri] = true;
        mp[t[fri - 1]] = fri;
        map<int, int>::iterator it;
        it = mp.begin();
        check[it->second] = false;
        mp.erase(it);
      }
    } else {
      if (check[fri] == true) {
        printf("%s", "YES");
        ;
        printf("\n");
        ;
      } else {
        printf("%s", "NO");
        ;
        printf("\n");
        ;
      }
    }
  }
  return 0;
}
