#include <bits/stdc++.h>
using namespace std;
long long int color[150001], arr[150001];
int main() {
  long long int koyta, quere, sz, i, j, k, cnt, chk[10], pos, sel, indx, val,
      mn;
  cin >> koyta >> sz >> quere;
  memset(color, 0, sizeof(color));
  for (i = 1; i <= koyta; i++) {
    cin >> arr[i];
  }
  k = 0;
  for (i = 1; i <= quere; i++) {
    cin >> sel >> indx;
    if (sel == 1) {
      val = arr[indx];
      if (k < sz) {
        color[indx] = 1;
        chk[++k] = indx;
      } else {
        mn = 0x3f3f3f3f;
        int paisi = 0;
        for (j = 1; j <= k; j++) {
          if (val > arr[chk[j]]) {
            if (mn > arr[chk[j]]) {
              pos = j;
              mn = min(mn, arr[chk[j]]);
              paisi = 1;
            }
          }
        }
        if (paisi == 1) {
          color[chk[pos]] = 0;
          color[indx] = 1;
          chk[pos] = indx;
        }
      }
    } else if (sel == 2) {
      if (color[indx] == 1) {
        printf("YES\n");
      } else {
        printf("NO\n");
      }
    }
  }
  return 0;
}
