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() {
  int N, K, Q, val, idFriend;
  cin >> N >> K >> Q;
  vector<pair<int, int>> friends;
  vector<int> showedRatings(K);
  for (int i = 0; i < N; ++i) {
    cin >> val;
    friends.push_back(pair<int, int>(val, 0));
  }
  for (int i = 0; i < Q; ++i) {
    cin >> val;
    cin >> idFriend;
    idFriend -= 1;
    switch (val) {
      case 1:
        friends[idFriend].second = 1;
        if (showedRatings[K - 1] < friends[idFriend].first)
          for (int j = 0; j < K; ++j)
            if (showedRatings[j] < friends[idFriend].first) {
              int rCopy = showedRatings[j];
              int rCopySecond = 0;
              showedRatings[j] = friends[idFriend].first;
              for (int t = j + 1; t < K; ++t) {
                rCopySecond = showedRatings[t];
                showedRatings[t] = rCopy;
                rCopy = rCopySecond;
              }
              break;
            }
        break;
      case 2:
        if (friends[idFriend].second != 1)
          cout << "NO\n";
        else if (friends[idFriend].first >= showedRatings[K - 1])
          cout << "YES\n";
        else
          cout << "NO\n";
        break;
      default:
        break;
    }
  }
}
