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 int n, m, t, i = 1, j = 0, k, c, x, y, z, d = 0, g = 0,
                       h = 1000000000;
set<long long int> v, w;
long long int b[1000007];
string s;
int main() {
  cin >> n >> k >> t;
  long long int a[n + 1], e[n + 1], f[n + 1];
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    e[i] = a[i];
    f[i] = a[i];
  }
  sort(e + 1, e + n + 1);
  while (t--) {
    cin >> x >> y;
    c = 0;
    if (x == 1) {
      b[y]++;
      if (b[y] < 2) d++;
      g = max(y, g);
      y = min(y, g);
    } else {
      if (b[y]) {
        if (d <= k)
          c = 1;
        else {
          if (a[y] >= e[n - k + 1]) {
            c = 1;
          } else {
            c = 0;
            d -= 1;
          }
        }
      } else
        c = 0;
      if (c)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}
