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;
long long int t[150000];
int n[150000];
int main() {
  int a, b, c, i, j, k, f, d, q, o;
  long long int min = 1000000000;
  cin >> a >> b >> c;
  d = b;
  for (i = 0; i < a; i++) {
    cin >> t[i];
  }
  for (i = 0; i < c; i++) {
    o = 0;
    cin >> f >> q;
    switch (f) {
      case 1:
        if (d != 0) {
          n[d - 1] = q - 1;
          if (t[n[d - 1]] < min) {
            min = t[n[d - 1]];
            k = d - 1;
          }
          d--;
        } else if (t[q - 1] > min) {
          n[k] = q - 1;
          min = 1000000000;
          for (j = 0; j < b; j++) {
            if (t[n[j]] < min) {
              min = t[n[j]];
              k = j;
            }
          }
        }
        cout << "    " << min << "\n";
        break;
      case 2:
        if (t[q - 1] < min) {
          cout << "NO\n";
        } else {
          for (j = 0; j < b; j++) {
            if (n[j] == q - 1) {
              o = 1;
              break;
            }
          }
          if (o == 1) {
            cout << "YES\n";
          } else {
            cout << "NO\n";
          }
        }
    }
  }
}
