#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int Set(int N, int pos) { return N = N | (1 << pos); }
int Reset(int N, int pos) { return N = N & ~(1 << pos); }
bool Chkbit(int N, int pos) { return (bool)(N & (1 << pos)); }
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const double eps = 1e-6;
int n, k, q, a[2000005];
int main() {
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int l = 0, bb[8];
  while (q--) {
    int chk, id;
    scanf("%d %d", &chk, &id);
    if (chk == 1) {
      if (l < k)
        bb[l++] = id;
      else {
        int h = a[bb[0]];
        for (int i = 1; i < k; i++) h = min(h, a[bb[i]]);
        for (int i = 0; i < k; i++) {
          if (a[bb[i]] == h && h < a[id]) {
            bb[i] = id;
            break;
          }
        }
      }
    } else {
      int f = 0;
      for (int i = 0; i < l; i++)
        if (bb[i] == id) f = 1;
      if (f)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
