1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

#include <bits/stdc++.h>
using namespace std;
long long n, i, a[100001], b, cnt, j, k, q, l, mn;
vector<long long> vc;
void push(long long l) {
  if (vc.size() < k)
    vc.push_back(l);
  else {
    long long c = 0;
    mn = INT_MAX;
    while (c < vc.size()) {
      if (a[vc[c] - 1] < mn) {
        mn = a[vc[c] - 1];
        b = c;
      }
      c++;
    }
    if (mn < a[l - 1]) {
      vc[b] = l;
    }
  }
}
bool check(long long l) {
  long long c = 0;
  while (c < vc.size()) {
    if (vc[c] == l) {
      return true;
    }
    c++;
  }
  return false;
}
int main() {
  cin >> n >> k >> q;
  for (i = 0; i < n; i++) cin >> a[i];
  while (q--) {
    cin >> j >> l;
    if (j == 1)
      push(l);
    else {
      if (check(l))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}
