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 n, k, q;
long t[150005];
bool kt[150005] = {false};
int main() {
  cin >> n >> k >> q;
  for (long i = 1; i < n + 1; i++) {
    scanf("%ld", &t[i]);
  }
  int x;
  long y;
  pair<long, long> pt[150005];
  long np = 0;
  long i = 0;
  int tt = 1;
  while (q--) {
    scanf("%d%ld", &x, &y);
    if (x == 1) {
      if (kt[y] == true) {
        continue;
      }
      kt[y] = true;
      if (np == k) {
        if (tt == 1)
          i = np, tt = 0;
        else {
          i = 0;
        }
        pt[i] = make_pair(t[y], y);
        sort(pt, pt + np + 1);
        for (int i = 0; i <= np; i++) {
          cout << pt[i].first << " " << pt[i].second << endl;
        }
        kt[pt[0].second] = false;
      } else
        pt[np++] = make_pair(t[y], y);
    } else {
      (kt[y]) ? puts("YES") : puts("NO");
      printf("\n");
    }
  }
  return 0;
}
