#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k, q;
  cin >> n >> k >> q;
  map<int, int> mp;
  priority_queue<pair<int, int>> pq;
  for (int i = 0; i < n; i++) {
    int z;
    cin >> z;
    mp[i + 1] = z;
  }
  for (int i = 0; i < q; i++) {
    int a, b;
    cin >> a >> b;
    if (a == 1) {
      pq.push({mp[b], b});
    }
    if (a == 2) {
      int f = 0;
      vector<pair<int, int>> vtemp;
      int tk = k;
      while (tk-- and !pq.empty()) {
        auto ptr = pq.top();
        if (ptr.second == b) {
          f = 1;
          cout << "YES\n";
          break;
        }
        pq.pop();
        vtemp.push_back(ptr);
      }
      for (auto i : vtemp) {
        pq.push(i);
      }
      vtemp.clear();
      if (f == 0) {
        cout << "NO\n";
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
