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;
int n, k, m;
int a[2000001];
int b[10000];
bool used[2000001];
int x, y;
bool cmp(int a, int b) { return a > b; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> m;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  int last = 0;
  for (int i = 1; i <= m; ++i) {
    cin >> x >> y;
    if (x == 2) {
      if (used[y] == false || (last == k && a[y] < b[k]))
        cout << "NO";
      else
        cout << "YES";
      cout << '\n';
    } else {
      used[y] = true;
      if (last == k && a[y] < b[k]) continue;
      if (last == k)
        b[last] = a[y];
      else {
        ++last;
        b[last] = a[y];
      }
      sort(b + 1, b + last + 1, cmp);
    }
  }
}
