#include<stdio.h>
#include<stdlib.h>

typedef struct node{
    int data;
    struct node *next;
}s1;
struct node *head=NULL,*tail=NULL;
void create(int num){
    s1 *New=(s1*)malloc(1*sizeof(s1));
    New->data=num;
    New->next=NULL;
    if(head==NULL){
        head=New;
        tail=New;
    }else{
        tail->next=New;
        tail=New;
    }
}
void delete(int pos){
    s1 *prev=head;
    s1 *current=head->next;
    s1 *temp=head;
    int count=0;
    
    for(int i=0;i<pos && temp!=NULL){
        prev=temp;
        temp=temp->next;
    }prev->next=temp->next;
}
void display(){
    s1 *i;
    for(i=head;i!=NULL;i=i->next){
        printf("%d ",i->data);
    }
}
int main(){
    int size,num;
    scanf("%d",&size);
    for(int i=0;i<size;i++){
        scanf("%d/n",&num);
        create(num);
    }
    int pos;
    scanf("%d",&pos);
    delete(pos);
    display();
    
    return 0;
}