#include <bits/stdc++.h>
using namespace std;
long long t[200000];
int main() {
  int n, k, q;
  scanf("%d %d %d", &n, &k, &q);
  for (int i = 0; i < n; i++) scanf("%lld", &t[i]);
  int type, id;
  set<long long> m_s;
  priority_queue<long long> m_q;
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &type, &id);
    if (type == 1) {
      m_q.push(-t[id - 1]);
      m_s.insert(-t[id - 1]);
      if ((int)m_q.size() > k) {
        m_s.erase(m_q.top());
        m_q.pop();
      }
    } else if (type == 2) {
      if (m_s.count(-t[id - 1]))
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
}
