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;
const int N = 4e5 + 5;
int t[N];
set<int> st;
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &t[i]);
  }
  while (q--) {
    int type, friendId;
    scanf("%d%d", &type, &friendId);
    if (type == 1) {
      st.insert(t[friendId]);
      if ((int)st.size() > k) st.erase(*(st.begin()));
    } else if (type == 2) {
      bool ok = 0;
      int tmp = 1;
      set<int>::reverse_iterator rit;
      for (rit = st.rbegin(); rit != st.rend(); ++rit) {
        if (tmp <= k) {
          if (t[friendId] == *rit) {
            ok = 1;
            break;
          }
        } else {
          break;
        }
        tmp++;
      }
      if (ok)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
