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;
bool pairCompare(const pair<int, int>& firstElem,
                 const pair<int, int>& secondElem) {
  return firstElem.second > secondElem.second;
}
int main() {
  int n, k, q, a[150001], type, id, b[150001], temp;
  bool z;
  vector<pair<int, int> > v;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 0; i < q; ++i) {
    scanf("%d%d", &type, &id);
    if (type == 1) {
      v.push_back(make_pair(id, a[id]));
      if (v.size() > k) {
        sort(v.begin(), v.end(), pairCompare);
        v.pop_back();
      }
    } else {
      z = false;
      for (vector<pair<int, int> >::iterator it = v.begin(); it != v.end();
           ++it)
        if (it->first == id) z = true;
      if (z == true)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
