#include <bits/stdc++.h>
using namespace std;
bool ok[300500];
int t[200500];
int now[200500];
set<int> S;
int main() {
  int n, k, q, sz = 0;
  int type, id;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) cin >> t[i];
  while (q--) {
    scanf("%d%d", &type, &id);
    id--;
    if (type == 1)
      S.insert(-t[id]);
    else {
      int it = 0;
      bool good = 0;
      for (auto i : S) {
        if (-i == t[id]) {
          puts("YES");
          good = 1;
          break;
        }
        it++;
        if (it == k) break;
      }
      if (!good) puts("NO");
    }
  }
  return 0;
}
