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 com(pair<int, int> i, pair<int, int> j) { return i.second < j.second; }
int n, k, q, x, y;
vector<pair<int, int> > a, b;
bool ok;
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    a.push_back(make_pair(i + 1, x));
  }
  for (int i = 0; i < q; i++) {
    scanf("%d%d", &x, &y);
    if (x == 1) {
      if (b.size() == k) {
        sort(b.begin(), b.end(), com);
        if (a[y - 1].second >= b[0].second) {
          b[0] = a[y - 1];
        }
      } else
        b.push_back(a[y - 1]);
    } else {
      ok = false;
      for (int i = 0; i < b.size(); i++) {
        if (b[i].first == y) {
          ok = true;
          break;
        }
      }
      if (ok)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
