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;
}
int rating[150001];
int main() {
  freopen("displayed.txt", "r", stdin);
  int t, i, j, tc = 0;
  int a, b, n, k, q, m;
  while (scanf("%d %d %d", &n, &k, &q) == 3) {
    for (i = 1; i <= n; ++i) {
      scanf("%d", &rating[i]);
    }
    set<int> online;
    for (i = 0; i <= q - 1; ++i) {
      scanf("%d", &a);
      scanf("%d", &b);
      if (a == 1) {
        online.insert(b);
        if (online.size() > k) {
          set<int>::iterator it;
          int w = *online.begin();
          for (it = online.begin(); it != online.end(); it++) {
            if (rating[*it] < rating[w]) w = *it;
          }
          online.erase(w);
        }
      } else {
        if (online.find(b) == online.end())
          printf("NO\n");
        else
          printf("YES\n");
      }
    }
  }
  return 0;
}
