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;
int Prime(unsigned long a) {
  unsigned long i;
  if (a == 2) return 1;
  if (a == 0 || a == 1 || a % 2 == 0) return 0;
  for (i = 3; i * i <= a && a % i; i += 2)
    ;
  return i * i > a;
}
int ispow(int a) { return !(a & (a - 1)); }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main() {
  iostream::sync_with_stdio(0);
  cin.tie(0);
  int n, k, q;
  cin >> n >> k >> q;
  vector<int> a(n);
  for (int i = 0; (i) < (n); ++i) cin >> a[i];
  vector<int> z(q);
  vector<int> o;
  vector<string> ans;
  int b;
  for (int i = 0; (i) < (q); ++i) {
    cin >> b;
    if (b == 1) {
      int d;
      cin >> d;
      o.push_back(a[d - 1]);
      if ((int)o.size() > k) {
        decltype(o.begin()) it = o.begin();
        int l = k;
        while (l != -1) {
          ++it;
          --l;
        }
        sort(o.begin(), it, [](int a, int b) { return a > b; });
      }
    } else {
      int j;
      cin >> j;
      bool ch = false;
      for (int i = 0; (i) < (min((int)o.size(), k)); ++i)
        if (o[i] == a[j - 1]) {
          ch = true;
          break;
        }
      if (ch)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  for (int i = 0; (i) < ((int)ans.size()); ++i) cout << ans[i] << endl;
  return 0;
}
