#include <bits/stdc++.h>
using namespace std;
const int K = 10;
const int NQ = 160000;
int n, k, q;
int v[NQ];
pair<int, int> lg[K];
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  for (int i = 0; i < k; i++) {
    lg[i].first = -1;
    lg[i].second = -1;
  }
  for (int i = 0; i < q; i++) {
    int x, y;
    cin >> x >> y;
    y--;
    if (x == 1) {
      if (lg[0].first == -1 || lg[0].first < v[y]) {
        lg[0] = make_pair(v[y], y);
        sort(lg, lg + k);
      }
    } else {
      bool flag = false;
      for (int i = 0; i < k; i++) {
        if (lg[i].second == y) {
          flag = true;
        }
      }
      cout << (flag ? "YES" : "NO") << endl;
    }
  }
  return 0;
}
