#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
int n, k, q;
int id[N];
int zx[N];
struct asd {
  int v, b;
};
asd zxx[10];
bool cmp(asd a, asd f) { return a.b < f.b; }
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> k >> q;
  int op, num;
  for (int i = 1; i <= n; i++) cin >> id[i];
  int cnt = 0;
  while (q--) {
    cin >> op >> num;
    if (op == 1) {
      if (k > 0) {
        zxx[cnt].v = num;
        zxx[cnt].b = id[num];
        cnt++;
        zx[num]++;
        k--;
      } else {
        sort(zxx, zxx + cnt, cmp);
        if (id[num] > zxx[0].b) {
          zx[num]++;
          zx[zxx[0].v] = -1;
          zxx[0].v = num;
          zxx[0].b = id[num];
        }
      }
    } else {
      if (zx[num] > 0)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
