#include <bits/stdc++.h>
using namespace std;
int n, k, Q, type, id;
bool flag = false;
int mapp[999999];
vector<int> myVec;
int main() {
  scanf("%d%d%d", &n, &k, &Q);
  for (int i = 1; i <= n; i++) scanf("%d", &mapp[i]);
  for (int q = 0; q < Q; q++) {
    scanf("%d%d", &type, &id);
    if (type == 2) {
      bool flag2 = false;
      int SIZE = myVec.size();
      for (int i = 0; i < min(SIZE, k); i++)
        if (mapp[id] == myVec[i]) {
          printf("YES\n");
          flag2 = true;
          break;
        }
      if (!flag2) printf("NO\n");
    } else {
      if (!flag) {
        myVec.push_back(mapp[id]);
        flag = true;
      } else {
        int i = 0;
        while (mapp[id] < myVec[i] && i < myVec.size()) i++;
        myVec.insert(myVec.begin() + i, mapp[id]);
      }
    }
  }
  return 0;
}
