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;
bool comp(long long n) {
  for (int i = 2; i < n; i++) {
    if (n % i == 0) return true;
  }
  return false;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
string toBinary(int n) {
  std::string r;
  while (n != 0) {
    r = (n % 2 == 0 ? "0" : "1") + r;
    n /= 2;
  }
  return r;
}
int main() {
  long long n, k, q, x;
  bool z;
  while (cin >> n >> k >> q) {
    set<long long> a;
    vector<long long> f(n + 1);
    for (int i = 1; i <= n; i++) {
      cin >> f[i];
    }
    for (int i = 0; i < q; i++) {
      cin >> x;
      if (x == 1) {
        cin >> x;
        if (a.size() < k) {
          a.insert(f[x]);
        } else {
          a.erase(a.cbegin());
          a.insert(f[x]);
        }
      } else if (x == 2) {
        cin >> x;
        set<long long>::iterator it = a.begin();
        z = false;
        while (it != a.end()) {
          if (f[x] == *it) {
            cout << "YES" << endl;
            z = true;
            break;
          }
          it++;
        }
        if (!z) cout << "NO" << endl;
      }
    }
    a.clear();
    f.clear();
  }
  return 0;
}
