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, k, q;
void f1(long long x, pair<long long, long long> *ko, long long *zn) {
  if (zn[x] >= ko[0].first) {
    ko[0].second = x;
    ko[0].first = zn[x];
  }
  sort(ko, ko + k);
}
bool f2(long long x, pair<long long, long long> *ko) {
  for (long long i = 0; i < k; ++i) {
    if (ko[i].second == x) {
      return true;
      break;
    } else if (i == k - 1)
      return false;
  }
}
int main() {
  cin >> n >> k >> q;
  pair<long long, long long> ko[k];
  long long koi[k];
  long long zn[n];
  vector<bool> u;
  for (long long i = 0; i < n; ++i) {
    cin >> zn[i];
  }
  for (long long j = 0; j < k; ++j) {
    ko[j].first = 0;
    ko[j].second = 0;
  }
  long long a;
  for (long long i = 0; i < q; ++i) {
    cin >> a;
    if (a == 1) {
      cin >> a;
      a--;
      f1(a, ko, zn);
    } else {
      cin >> a;
      a--;
      u.push_back(f2(a, ko));
    }
  }
  for (long long i = 0; i < (long long)(u.size()); ++i) {
    if (u[i] == true)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
