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 gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline void deb(T a) {
  cout << "debugging -> " << a << '\n';
}
template <class T>
inline void deb2(T a, T b) {
  cout << "first value-> " << a << ' ' << "second value-> " << b << '\n';
}
long long power(int n, int p) {
  long long PW = 1;
  long long m = n;
  for (int i = 1; i <= p; i++) PW *= m;
  return PW;
}
struct data {
  int rating;
  int num;
  void scan() { scanf("%d", &rating); }
};
data friends[150001];
vector<pair<int, int> > online;
bool cmp(pair<int, int> a, pair<int, int> b) {
  if (a.first > b.first) return true;
  return false;
}
int is_online[150005];
int main() {
  int t, i, j, tc = 0;
  int a, b, n, k, q, m;
  while (scanf("%d %d %d", &n, &k, &q) == 3) {
    for (i = 0; i <= n - 1; ++i) {
      friends[i].scan();
      friends[i].num = i + 1;
    }
    for (i = 1; i <= n; ++i) is_online[i] = 0;
    int onc = 0, flag = 0;
    for (i = 0; i <= q - 1; ++i) {
      scanf("%d", &a);
      scanf("%d", &b);
      if (a == 1) {
        is_online[b] = 1;
        int x = friends[b - 1].rating;
        online.push_back(make_pair(x, b));
        if (onc) {
          if (online[onc].first < online[onc - 1].first) flag = 1;
        }
        onc++;
      } else {
        if (!(is_online[b]))
          printf("NO\n");
        else {
          if (onc < k)
            printf("YES\n");
          else {
            if (flag) {
              sort(online.begin(), online.end(), cmp);
              flag = 0;
            }
            if (friends[b - 1].rating >= online[k - 1].first)
              printf("YES\n");
            else
              printf("NO\n");
          }
        }
      }
    }
  }
  return 0;
}
