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 double EPS = 1e-9;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
template <typename t1>
t1 gcd(t1 a, t1 b) {
  return b == 0 ? a : gcd(b, a % b);
}
template <typename t1>
t1 lcm(t1 a, t1 b) {
  return a * (b / gcd(a, b));
}
int main() {
  int n, k, q;
  while (cin >> n >> k >> q) {
    int a[n + 1];
    for (int i = 1; i <= n; i++) cin >> a[i];
    int b[k + 1];
    int now = 0;
    int color[n + 1], online[10];
    memset(color, 0, sizeof color);
    memset(online, 0, sizeof online);
    for (int i = 1; i <= q; i++) {
      int x, id;
      cin >> x >> id;
      if (x == 1) {
        int pp = (-1) * a[id];
        if (pp <= online[now]) online[now] = pp;
        now++;
        if (now == 10) now--;
        color[id] = 1;
        sort(online, online + 10);
      } else {
        if (color[id] == 1 && online[k - 1] >= ((-1) * a[id]))
          cout << "YES" << endl;
        else
          cout << "NO" << endl;
      }
    }
  }
}
