#include <bits/stdc++.h>
using namespace std;
int dr[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dc[] = {0, -1, 0, 1, -1, 1, -1, 1};
const int MAX = 1e6 + 7;
const int MOD = 1e9;
int a[MAX];
set<pair<long long, long long> > s;
int main() {
  int n, k, q;
  scanf("%d", &n), scanf("%d", &k), scanf("%d", &q);
  for (long long i = 0; i < n; ++i) scanf("%d", &a[i]);
  for (long long i = 0; i < q; ++i) {
    int t, x;
    scanf("%d", &t), scanf("%d", &x);
    if (t == 1) {
      s.insert(pair<long long, long long>(a[x - 1], x));
      if ((long long)s.size() > k) s.erase(s.begin());
    } else
      cout << ((s.count(pair<long long, long long>(a[x - 1], x))) ? "YES\n"
                                                                  : "NO\n");
  }
}
