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 INF = 2000000009;
const int Max = 1000007;
const double PI = acos(-1.0);
int tt[Max];
pair<int, int> online[12];
int main() {
  int i, j, k, l, id, temp, q, t, n, m, caseno = 0, ans;
  string str;
  while (cin >> n >> k >> q) {
    for (i = 0; i < 10; i++) online[i].first = -1;
    for (i = 1; i <= n; i++) cin >> tt[i];
    while (q--) {
      cin >> m >> id;
      if (m == 1) {
        online[9] = make_pair(tt[id], id);
        for (j = 8; j >= 0; j--) {
          if (online[j].first > online[j + 1].first) break;
          swap(online[j], online[j + 1]);
        }
      } else {
        ans = 0;
        for (i = 0; i < k; i++) {
          if (online[i].second == id) {
            ans = 1;
            break;
          }
        }
        if (ans)
          cout << "YES\n";
        else
          cout << "NO\n";
      }
    }
  }
  return 0;
}
