#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN(150005);
int a[MAXN], b[15];
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  while (q--) {
    int t, id;
    scanf("%d%d", &t, &id);
    b[k] = id;
    if (t == 1) {
      for (int i = k; i >= 1; i--) {
        if (a[b[i]] > a[b[i - 1]]) swap(b[i], b[i - 1]);
      }
    } else {
      bool found = false;
      for (int i = 0; i < k; i++) {
        if (b[i] == id) {
          found = true;
          break;
        }
      }
      if (found)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
}
