#include <bits/stdc++.h>
long long mod = 1000000007;
using namespace std;
int n;
struct node {
  int id;
  int fr;
} a[1000005];
bool operator<(const node& x, const node& y) { return x.fr < y.fr; }
set<node> S;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int main() {
  int i, j, fl, test, k, q, id, ch;
  scanf("%d%d%d", &n, &k, &q);
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i].fr);
    a[i].id = i + 1;
  }
  int on = 0;
  while (q--) {
    scanf("%d%d", &ch, &id);
    node temp;
    temp = a[id - 1];
    if (ch == 1) {
      if (on < k) {
        S.insert(temp);
        on++;
      } else if (temp.fr > (*S.begin()).fr) {
        S.erase(S.begin());
        S.insert(temp);
      }
    } else {
      if (S.find(temp) != S.end())
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
