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 N, Q, K, T[150002], x, cnt = 0, onl[150002], l;
bool A[150002];
int main() {
  cin >> N >> K >> Q;
  for (int i = 1; i <= N; i++) cin >> T[i];
  for (int i = 1; i <= Q; i++) {
    cin >> x >> l;
    if (x == 1) {
      if (A[l] == 0) {
        A[l] = 1;
        if (cnt == K) {
          int aux = 1;
          for (int j = 1; j <= cnt; j++)
            if (T[onl[j]] < T[onl[aux]]) aux = j;
          if (T[l] > T[onl[aux]]) {
            A[onl[aux]] = 0;
            onl[aux] = l;
          } else
            A[l] = 0;
        } else
          onl[++cnt] = l;
      }
    } else if (A[l])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  for (int i = 1; i <= cnt; i++) cout << onl[i] << " ";
  return 0;
}
