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>
int T[150000];
int Displays[6];
int Size;
int main() {
  int n, k, q, i, j, type, id;
  scanf("%d %d %d", &n, &k, &q);
  for (i = 0; i < n; ++i) {
    scanf("%d", &T[i]);
  }
  while (q--) {
    scanf("%d %d", &type, &id);
    --id;
    if (type == 1) {
      for (i = 0; i < k; ++i) {
        if (i >= Size || T[id] > T[Displays[i]]) {
          break;
        }
      }
      if (i < k) {
        for (j = k - 1; j > i; --j) {
          Displays[j] = Displays[j - 1];
        }
        Displays[i] = id;
      }
      ++Size;
    } else {
      char find = 0;
      for (i = 0; i < Size && i < k; ++i) {
        if (Displays[i] == id) {
          find = 1;
          break;
        }
      }
      puts(find ? "YES" : "NO");
    }
  }
  return 0;
}
