#include <bits/stdc++.h>
using namespace std;
set<pair<int, int> > s;
int a[1000111];
int main() {
  int n, q, i, j, k;
  scanf("%d %d %d", &n, &k, &q);
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    a[i] = (-1) * a[i];
  }
  for (i = 0; i < q; i++) {
    int t, x;
    scanf("%d %d", &t, &x);
    x--;
    if (t == 1)
      s.insert(make_pair(a[x], x));
    else {
      int c = 0, flag = 0;
      for (set<pair<int, int> >::iterator it = s.begin(); it != s.end(); it++) {
        if (it->second == x) {
          printf("YES\n");
          flag = 1;
          break;
        }
        c++;
        if (c == k) break;
      }
      if (flag == 0) printf("NO\n");
    }
  }
  return 0;
}
