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;
multimap<int, int> online;
bool finds(pair<int, int> f) {
  int index = -1;
  int k = 0;
  for (auto i = online.begin(); i != online.end(); ++i, ++k)
    if (i->first == f.first && i->second == f.second) {
      index = k;
      break;
    }
  return index != -1;
}
int main() {
  vector<int> a;
  vector<string> answer;
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 0; i < n; ++i) {
    int tmp;
    cin >> tmp;
    a.push_back(tmp);
  }
  for (int i = 0; i < q; ++i) {
    char c;
    int tmp;
    cin >> c >> tmp;
    if (c == '1') {
      online.insert(pair<int, int>(a[tmp - 1], tmp - 1));
      if (online.size() > k) online.erase(online.begin());
    } else {
      if (finds(pair<int, int>(a[tmp - 1], tmp - 1)))
        answer.push_back("YES");
      else
        answer.push_back("NO");
    }
  }
  for (auto i : answer) cout << i << endl;
  return 0;
}
