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;
const int N = 150003;
const int MAXK = 1e5 + 3;
const int Candy = 1e7;
const int mod = 1e9 + 7;
const long long mod1 = 2ll * (mod - 1);
const long long inf = 1ll << 55;
const double pi = 3.1415926535897932384626433;
const long double eps = 1e-12;
long long fast_pow(int a, int b) {
  long long res = a, ret = 1;
  while (b > 0) {
    if (b % 2) ret = (ret * res) % mod;
    res = (res * res) % mod;
    b /= 2;
  }
  return ret;
}
long long fact(long long n) {
  if (n == 1 || n == 0) return 1;
  return ((n % mod) * (fact(n - 1) % mod) % mod);
}
long long nCk(long long n, long long r) {
  return (fact(n) * fast_pow((fact(r) * fact(n - r)) % mod, mod - 2)) % mod;
}
long long n, k, q, t[N], cnt;
vector<int> b;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> q;
  for (long long i = (1); i <= (n); ++i) cin >> t[i];
  while (q--) {
    int id;
    cin >> id;
    if (id == 1) {
      int a;
      cin >> a;
      if (cnt < k) {
        b.push_back(-t[a]);
        sort((b).begin(), (b).end());
        cnt++;
      } else {
        if (t[a] > b[0]) {
          b[0] = t[a];
          sort((b).begin(), (b).end());
        }
      }
    }
    if (id == 2) {
      int a;
      cin >> a;
      if (((int)(b).size()) && t[a] >= b[0] && t[a] <= b[min(cnt, k) - 1]) {
        cout << "YES\n";
      } else
        cout << "NO\n";
    }
  }
  return (!false && !true) || ((long long)((long long)(1713 + 2377 + 1464) *
                                           (long long)(1713 + 2377 + 1464) *
                                           (long long)(1713 + 2377 + 1464)) !=
                               (long long)(171323771464));
}
