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;
const long long LINF = (long long)1e18;
const int INF = (int)1e9 + 7;
const int N = (int)1e5 + 1;
set<int> s;
bool u[N + 5];
int a[2 * N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k, q, t, x;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= q; ++i) {
    cin >> t >> x;
    if (t == 1) {
      if (s.size() == k) {
        if (*s.begin() < a[x]) {
          s.insert(a[x]);
          s.erase(s.begin());
        }
      } else
        s.insert(a[x]);
    } else {
      int r = s.size();
      s.insert(a[x]);
      if (r == s.size())
        cout << "YES" << endl;
      else {
        cout << "NO" << endl;
        s.erase(a[x]);
      }
    }
  }
  return 0;
}
