#include <bits/stdc++.h>
using namespace std;
int n, k, q, cnt, a[150005], t, y;
bool mp[150005];
pair<int, int> b[150005];
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &t, &y);
    if (t == 1) {
      if (cnt < k) {
        b[cnt].first = a[y - 1];
        b[cnt++].second = y - 1;
        mp[y - 1] = true;
      } else {
        sort(b, b + cnt);
        if (a[y - 1] > b[0].first) {
          mp[b[0].second] = false;
          b[0].first = a[y - 1];
          b[0].second = y - 1;
          mp[y - 1] = true;
        }
      }
    } else {
      if (mp[y - 1])
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
