#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 1e5 + 1, inf = 1e9 + 1;
int a[MAXN], b[10];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int i, n, k, q, t;
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < q; i++) {
    int id, ind;
    cin >> id >> ind;
    if (id == 1) {
      int j = k - 1;
      while (j >= 0 && a[b[j]] > a[ind]) {
        j--;
      }
      if (j >= 0) {
        for (int l = 0; l < j; l++) b[l] = b[l + 1];
        b[j] = ind;
      }
    } else {
      bool u = false;
      for (int j = 0; j < k; j++) {
        if (b[j] == ind) u = true;
      }
      if (u == true)
        cout << "YES";
      else
        cout << "NO";
      cout << endl;
    }
  }
  return 0;
}
