#include <stdlib.h>
#include <stdio.h>
typedef int ElemType;
typedef struct LNode
{
ElemType data;
struct LNode *next;
} LNode ,*linkList;
void CreateList_H(linkList *L, int n)
{
*L=(LNode*)malloc(sizeof(LNode));
(*L)->next=NULL;
LNode* current;
LNode* tail;
tail=*L;
for(int i=0;i<n;i++)
{
current=(LNode*)malloc(sizeof(LNode));
scanf("%d",¤t->data);
current->next=tail->next;
tail->next=current;
tail=current;
}
}
void delete1(linkList *L,int x)
{
LNode *p=*L;
int i=1;
while (p->next != NULL && i < x) {
p = p->next;
i++;
}
LNode *s=(LNode*)malloc(sizeof(LNode));
s=p->next;
int e=s->data;
p->next=s->next;
free(s);
}
void PrintList (linkList L)
{
LNode *head=L->next;
while(head!=NULL)
{
printf("%d ",head->data);
head=head->next;
}
}
int main()
{
linkList L;
int n,x;
scanf("%d",&n);
CreateList_H(&L, n);
scanf("%d",&x);
if (x>n||x<=0)
{
printf("-1");
}
else
{
delete1(&L,x);
PrintList (L);
}
return 0;
}