#include <bits/stdc++.h>
using namespace std;
const int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
template <class T>
void _print(T arg) {
  cout << arg << " ";
}
template <class... Args>
void log(Args... args) {
  int arr[] = {(_print(args), 0)...};
  cout << endl;
}
int n, m, k, q;
int t[N];
vector<int> v;
bool check(int id) {
  for (int x : v) {
    if (x == id) {
      return 1;
    }
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k >> q;
  for (int i = 1; i <= n; ++i) {
    cin >> t[i];
  }
  int op, id;
  while (q--) {
    cin >> op >> id;
    if (op == 1) {
      if (v.size() < k)
        v.push_back(id);
      else {
        sort(v.begin(), v.end(),
             [](const int x, const int y) { return t[x] < t[y]; });
        if (t[id] > t[v[0]]) v[0] = id;
      }
    } else {
      if (check(id))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
