import java.util.*;
public class Main {
private static Node<Integer> insert(int n, Scanner s){
Node<Integer> head = null;
Node<Integer> tail = null;
int val = s.nextInt();
int size = 0;
while(size < n){
Node<Integer> newNode = new Node<>(val);
if(head == null){
head = newNode;
tail = newNode;
} else{
tail.next = newNode;
tail = tail.next;
}
if(size < n)
val = s.nextInt();
size++;
}
return head;
}
public static void printLL(Node<Integer> head){
while (head != null){
System.out.print(head.val + " ");
head=head.next;
}
}
private static Node<Integer> kthFromTheEnd(Node<Integer> head, int n, int k){
int posFromStart = n - k - 1;
Node<Integer> temp = head;
int index = 0;
while(index < posFromStart){
temp = temp.next;
index++;
}
temp.next = temp.next.next;
return head;
}
public static void main (String args[]) {
Scanner s = new Scanner(System.in);
int size = s.nextInt();
int k = s.nextInt();
Node<Integer> head = insert(size, s);
printLL(kthFromTheEnd(head, size, k));
}
}
class Node {
T val;
Node<T> next;
public Node(T val){
this.val = val;
}
}