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;
vector<int> v;
int A[150007];
struct node {
  int a, b;
  node(int x = 0, int y = 0) {
    a = x;
    b = y;
  }
} entry[150007];
bool cmp(node x, node y) {
  if (x.b < y.b) {
    return false;
  }
  return true;
}
int main() {
  int n, k, q, t = 0;
  scanf("%d", &n);
  scanf("%d", &k);
  scanf("%d", &q);
  for (int i = 0; i <= n + 5; i++) {
    A[i] = 0;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &A[i]);
  }
  for (int i = 0; i < q; i++) {
    int s, d;
    scanf("%d", &s);
    scanf("%d", &d);
    if (s == 1) {
      sort(entry + 1, entry + k + 1, cmp);
      entry[k].a = d;
      entry[k].b = A[d];
    } else {
      int count = 0;
      for (int q = 1; q <= k; q++) {
        if (entry[q].a == d) {
          count = 1;
        }
      }
      if (count) {
        cout << "YES" << endl;
      } else
        cout << "NO" << endl;
    }
  }
}
