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 n, m, q, k;
int dai, dem, max1, doi, vtm, min1, dau, max2, d1, st;
int a[222222], b[222222], d[222222], onl[222222];
int tt, ban;
struct cs {
  int fr, tb;
};
cs msx[150005];
bool sx(int x, int y) { return x > y; }
int check() {
  int l, r, m;
  l = 0;
  r = k - 1;
  while (l < r) {
    m = (l + r) / 2;
    if (d[m] > a[ban - 1])
      l = m + 1;
    else
      r = m;
  }
  if (d[l] == a[ban - 1]) return 1;
  return 0;
}
void sol() {
  int i, j;
  if (tt == 1) {
    if (dem < k) {
      d[dem++] = a[ban - 1];
      sort(d, d + dem, sx);
    } else {
      d[k] = max(d[k], a[ban - 1]);
      sort(d, d + k + 1, sx);
    }
    return;
  }
  if (check() == 1)
    printf("YES\n");
  else
    printf("NO\n");
}
int main() {
  int i, j, x, y;
  while (scanf("%d %d  %d", &n, &k, &q) > 0) {
    for (i = 0; i < n; i++) {
      scanf("%d", &a[i]);
      msx[i].fr = i;
      msx[i].tb = a[i];
    }
    dem = 0;
    for (i = 0; i < q; i++) {
      scanf("%d %d", &tt, &ban);
      sol();
    }
  }
  return 0;
}
