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 main() {
  bool flag = false;
  map<long long, bool> mp;
  long long cnt = 0, n, k, q, x, y, j, a[100000], i, Min = 100000000000, c;
  pair<int, int> b[100000];
  cin >> n >> k >> q;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < q; i++) {
    cin >> x >> y;
    b[i].first = x;
    b[i].second = y;
  }
  for (i = 0; i < q; i++) {
    if (b[i].first == 1) {
      if (cnt == k) {
        mp[b[i].second - 1] = true;
        for (j = 0; j < n; j++) {
          if (mp[j] == true && a[j] < Min) {
            Min = a[j];
            c = j;
          }
        }
        mp[c] = false;
        cnt--;
      }
      if (Min != a[b[i].second - 1]) {
        mp[b[i].second - 1] = true;
        cnt++;
      }
    } else if (mp[b[i].second - 1] == true)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
