#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);
}
template <class T>
inline T bpow(T p, T e) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
int a[150005], b[150005];
int vis[150005];
struct zz {
  int from, cost;
  zz() {}
  zz(int a, int c) { from = a, cost = c; }
  bool friend operator<(zz a, zz b) { return a.from > b.from; }
};
priority_queue<zz> pq;
int main() {
  int n, m, k;
  scanf("%d %d", &n, &m);
  scanf("%d", &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int cnt = 0;
  for (int i = 1; i <= k; i++) {
    int g, h;
    scanf("%d %d", &g, &h);
    if (g == 1) {
      if (cnt < m) {
        cnt++;
        pq.push(zz(a[h], h));
        vis[h] = 1;
      } else {
        zz o = pq.top();
        if (o.from < a[h]) {
          vis[o.cost] = 0;
          vis[h] = 1;
          pq.push(zz(a[h], h));
          pq.pop();
        }
      }
    } else {
      if (vis[h] == 1)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
