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 suf(long long a) { return (a * (a + 1)) / 2; }
const long long OO = 1e6 + 10, MOD = 1e9 + 3;
vector<vector<int> > adj, can;
int dx[]{1, -1, 0, 0, 1, -1, 1, -1};
int dy[]{0, 0, 1, -1, 1, -1, -1, 1};
int main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  long long n, m, a, b, d, e, k, f, l, r, c;
  while (cin >> n >> k >> c) {
    vector<long long> v(n);
    for (int i = 0; i < n; i++) cin >> v[i];
    priority_queue<long long> q;
    map<long long, bool> mp;
    for (int i = 0; i < c; i++) {
      cin >> a >> b;
      b--;
      if (a == 1) {
        if (q.size() < k)
          q.push(v[b] * -1), mp[v[b] * -1] = true;
        else {
          if (q.top() * -1 < v[b])
            q.pop(), q.push(v[b] * -1), mp[v[b] * -1] = true;
        }
      } else {
        if (mp[v[b] * -1] == false)
          cout << "NO" << endl;
        else {
          if (v[b] >= q.top() * -1)
            cout << "YES" << endl;
          else
            cout << "NO" << endl;
        }
      }
    }
  }
  return 0;
}
