1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

#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];
int main() {
  int m, n, k;
  int t, tc = 1;
  long long N, M;
  while (scanf("%d %d", &n, &m) == 2) {
    memset(vis, 0, sizeof vis);
    scanf("%d", &k);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      b[i] = i;
    }
    int p, q, mn = 999999999, mx = 0, mi = 0, cnt = 0;
    for (int i = 1; i <= k; i++) {
      scanf("%d %d", &p, &q);
      if (p == 1) {
        cnt++;
        if (cnt <= m) {
          vis[q] = 1;
          mx = max(a[q], mx);
          if (a[q] < mn) {
            mn = a[q];
            mi = q;
          }
        } else {
          if ((a[q] > mn)) {
            vis[q] = 1;
            vis[mi] = 0;
            mn = a[q];
            mi = q;
          }
        }
      } else {
        if (vis[q] == 1)
          printf("YES\n");
        else
          printf("NO\n");
      }
    }
  }
  return 0;
}
