#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k, q;
  vector<bool> was;
  cin >> n >> k >> q;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    was.push_back(false);
  }
  vector<pair<long long, int> > wind;
  for (int i = 0; i < k; i++) {
    wind.push_back(make_pair(-1, -1));
  }
  for (int i = 0; i < q; i++) {
    int type, id;
    cin >> type >> id;
    if (type == 1) {
      if (!was[id - 1]) {
        was[id - 1] = true;
        wind.push_back(make_pair(a[id - 1], id));
        sort(wind.begin(), wind.end());
        reverse(wind.begin(), wind.end());
        wind.pop_back();
      }
    } else {
      bool flag = false;
      for (int j = 0; j < k; j++) {
        if (wind[j].second == id) {
          flag = true;
          break;
        }
      }
      if (flag) {
        printf("YES\n");
      } else {
        printf("NO\n");
      }
    }
  }
}
