#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
  int n, k, q, sz = 0;
  cin >> n >> k >> q;
  if (k > min(6, n)) k = min(6, n);
  pair<int, int> v[k + 1];
  int t[n + 1];
  for (int i = 1; i <= n; i++) cin >> t[i];
  for (int i = 1; i <= q; i++) {
    int d, c;
    cin >> d >> c;
    if (d == 1) {
      if (t[c] > v[0].second) {
        if (sz < k) {
          v[sz].first = c;
          v[sz].second = t[c];
          sz++;
          sort(v, v + sz - 1, cmp);
        } else {
          v[0].first = c;
          v[0].second = t[c];
          sort(v, v + sz, cmp);
        }
      } else {
        if (sz < k) {
          v[sz].first = c;
          v[sz].second = t[c];
          sz++;
          sort(v, v + sz, cmp);
        }
      }
    } else {
      bool ans = false;
      for (int i = 0; i < sz; i++) {
        if (v[i].first == c) {
          cout << "YES" << '\n';
          ans = true;
          break;
        }
      }
      if (ans == false) cout << "NO" << '\n';
    }
  }
}
