#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
int a[maxn];
set<pair<int, int> > ss;
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < q; i++) {
    int t, id;
    scanf("%d%d", &t, &id);
    if (t == 1) {
      ss.insert(make_pair(a[id], id));
      while (ss.size() > k) ss.erase(ss.begin());
    } else {
      bool flag = false;
      for (auto cur : ss)
        if ((cur.second == id)) flag = true;
      if (flag)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
