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;
map<long long int, long long int> a;
long long int n, m, k, x, c, y, z = 1;
bool flag = 0;
vector<string> V;
set<long long int> s;
set<long long int>::iterator it;
int main() {
  cin >> n >> m >> k;
  for (long long int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long int i = 1; i <= k; i++) {
    cin >> x >> y;
    if (x == 1)
      s.insert(a[y]);
    else if (x == 2 and s.size() == 0)
      continue;
    else {
      z = 1;
      flag = 0;
      c = s.size();
      it = s.end();
      it--;
      for (; z <= min(c, m); --it, z++) {
        if (a[y] == *it) {
          V.push_back("YES");
          flag = 1;
          break;
        }
      }
      if (!flag) V.push_back("NO");
    }
  }
  for (long long int i = 0; i < V.size(); i++) {
    cout << V[i] << endl;
  }
}
