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;
struct Node {
  int data;
  struct Node* next;
};
void sortedInsert(struct Node** head_ref, struct Node* new_node,
                  long long x[]) {
  struct Node* current;
  if (*head_ref == NULL || x[(*head_ref)->data] <= x[new_node->data]) {
    new_node->next = *head_ref;
    *head_ref = new_node;
  } else {
    current = *head_ref;
    while (current->next != NULL &&
           x[current->next->data] > x[new_node->data]) {
      current = current->next;
    }
    new_node->next = current->next;
    current->next = new_node;
  }
}
int chk(struct Node** head_ref, long long x) {
  struct Node* current;
  if (*head_ref == NULL) {
    return 0;
  } else {
    current = *head_ref;
    if (x == current->data) return 1;
    while (current->next != NULL) {
      if (x == current->next->data) return 1;
      current = current->next;
    }
  }
}
int rmv(struct Node** head_ref) {
  struct Node* current;
  long long con = 0;
  current = *head_ref;
  while (current->next != NULL) {
    con++;
    current = current->next;
  }
  current = *head_ref;
  for (long long int i = 0; i < con - 1; i++) {
    current = current->next;
  }
  current->next = NULL;
}
struct Node* newNode(int new_data) {
  struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));
  new_node->data = new_data;
  new_node->next = NULL;
  return new_node;
}
void printList(struct Node* head) {
  struct Node* temp = head;
  while (temp != NULL) {
    printf("%d  ", temp->data);
    temp = temp->next;
  }
}
int main() {
  long long x, y, n, m, k, q, a[150001] = {0}, cnt = 0, ans = 0;
  struct Node* head = NULL;
  struct Node* new_node;
  cin >> n >> k >> q;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i + 1];
  }
  for (long long int i = 0; i < q; i++) {
    cin >> x >> y;
    if (x == 1) {
      if (cnt >= k) {
        rmv(&head);
        cnt--;
      }
      new_node = newNode(y);
      sortedInsert(&head, new_node, a);
      cnt++;
      printList(head);
      cout << endl;
    } else {
      ans = chk(&head, y);
      if (ans)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
