#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const long long inf = 1e18 + 1;
long long n, m, k, q[maxn], v[maxn];
set<pair<long long, long long> > s;
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k >> m;
  for (int i = 0; i < n; i++) cin >> q[i];
  for (int i = 0; i < m; i++) {
    int t, j;
    cin >> t >> j;
    j--;
    if (t == 1) {
      if (s.size() < k)
        s.insert(make_pair(q[j], j)), v[j] = 1;
      else if (s.begin()->first < q[j])
        v[s.begin()->second] = 0, s.erase(s.begin()), v[j] = 1,
        s.insert(make_pair(q[j], j));
    } else {
      if (v[j])
        cout << "YES";
      else
        cout << "NO";
      cout << '\n';
    }
  }
}
