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;
set<int> st;
map<int, int> ma;
int ar[500000];
int ar2[100000];
int ar3[10000];
int ar4[10000];
int r3;
int main() {
  int i, n, m, k, j, sum, sum2, h1, h2, r, r2, ck, x, y, cnt;
  cin >> n >> m >> k;
  for (i = 1; i <= n; i++) {
    cin >> ar[i];
    ma[ar[i]] = i;
  }
  cnt = r = 0;
  r2 = 0;
  for (i = 1; i <= k; i++) {
    cin >> x >> y;
    if (x == 1) {
      ar2[y] = 1;
      cnt++;
      ar4[r3++] = ar[y];
      if (cnt > m) {
        r2 = min(ar4[0], ar4[1]);
        r2 = min(r2, ar4[2]);
        r2 = ma[r2];
        ar2[r2] = 0;
        cnt--;
        r3 = 0;
      }
    } else {
      if (ar2[y] == 1) {
        printf("YES\n");
      } else {
        printf("NO\n");
      }
    }
  }
}
