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>
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return ((a * b) / gcd(a, b)); }
using namespace std;
long long t[200000];
long long qu[200000];
int main() {
  long long i, j, k, l, m, n, q, no, ith;
  memset(qu, 0, sizeof(qu));
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) {
    cin >> t[i];
  }
  for (i = 1; i <= q; i++) {
    cin >> no >> ith;
    if (no == 1) {
      long long p = k;
      if (t[ith] > qu[p]) {
        qu[p] = t[ith];
        while ((qu[p] > qu[p - 1]) && (p > 1)) {
          swap(qu[p], qu[p - 1]);
          p--;
        }
      }
    } else {
      long long flag = 1;
      for (j = 1; j <= k; j++) {
        if (qu[j] == t[ith]) {
          cout << "YES" << '\n';
          flag = 0;
          break;
        }
      }
      if (flag) cout << "NO" << '\n';
    }
  }
}
