#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q, t, type, id;
  cin >> n >> k >> q;
  vector<int> v, v1;
  for (int i = 0; i < n; i++) {
    cin >> t;
    v1.push_back(t);
  }
  for (int i = 0; i < q; i++) {
    cin >> type >> id;
    if (type == 1) {
      if (v.size() < k) {
        v.push_back(v1[id - 1]);
        sort(v.begin(), v.end());
      } else if (v.size() >= k && v1[id - 1] > v[0]) {
        v[0] = v1[id - 1];
        sort(v.begin(), v.end());
      }
    } else {
      if (find(v.begin(), v.end(), v1[id - 1]) != v.end()) {
        cout << "YES"
             << "\n";
      } else {
        cout << "NO"
             << "\n";
      }
    }
  }
  return 0;
}
