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() {
  unsigned long long int n1, n2, n3;
  while (cin >> n1 >> n2 >> n3) {
    map<unsigned long long int, unsigned long long int> mapa1, mapa2, mapa3;
    set<pair<unsigned long long int, unsigned long long int>,
        greater<pair<unsigned long long int, unsigned long long int> > >
        st1;
    set<pair<unsigned long long int, unsigned long long int> >::iterator it;
    unsigned long long int var;
    for (unsigned long long int i = 1; i <= n1; i++) {
      cin >> var;
      mapa1[i] = var;
      mapa2[mapa1[i]] = i;
    }
    unsigned long long int x, y, cont = 0;
    for (unsigned long long int i = 0; i < n3; i++) {
      cin >> x >> y;
      if (x == 1) {
        if (cont < n2) {
          st1.insert(make_pair(mapa1[y], y));
          mapa3[y] = 1;
          cont++;
        } else {
          it = st1.end();
          it--;
          unsigned long long int auxiliar;
          auxiliar = it->first;
          if (mapa1[y] > auxiliar) {
            mapa3[it->second] = 0;
            st1.erase(it);
            st1.insert(make_pair(mapa1[y], y));
            mapa3[y] = 1;
          }
        }
      } else if (x == 2) {
        cout << y << " ";
        if (mapa3[y] == 1)
          cout << "YES\n";
        else
          cout << "NO\n";
      }
    }
  }
  return 0;
}
