#include <bits/stdc++.h>
using namespace std;
bool cmp(int a, int b) { return a > b; }
int main() {
  int n, k, q, t[150005] = {0}, on[150005] = {0}, scr[7] = {0}, cnt = 0,
               mi = 150005;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; i++) scanf("%d", &t[i]);
  for (int i = 0; i < q; i++) {
    int type, id;
    scanf("%d%d", &type, &id);
    if (type == 1) {
      on[id] = 1;
      scr[cnt++] = t[id - 1];
      sort(scr, scr + cnt, cmp);
      if (cnt > k) cnt--;
    } else {
      if (on[id] && t[id - 1] >= scr[k - 1])
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  return 0;
}
