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

typedef struct node
{
    int data;
    struct node *next;
}Node;
Node *head=NULL, *tail;
void create(int num){
Node *newNode = (Node*) malloc (1* sizeof (Node));
newNode->data=num;
newNode->next=NULL;
if(head==NULL)
{
    head=newNode;
    tail=newNode;
}
else
{
    tail->next=newNode;
    tail=newNode;
}
}
void insertion(int val,int pos,int size)
{
    Node *newNode = (Node*) malloc (1* sizeof (Node));
    newNode->data=val;
    newNode->next=NULL;
    if(pos==1)
    {
        newNode->next=head;
        head=newNode;
    }
    elseif(size+1 == pos)
    {
        tail->next=newNode;
        tail=newNode;
    }
    else
    {
        int cnt = 1;
        Node *itr = head;
        while(1)
        {
            if(cnt+1 == pos)
            {
                newNode->next = itr->next;
                itr->next=newNode;
                break;
            }
            itr=itr->next;
            cnt++;
        }
    }
}
void display()
{
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next)
    {
        printf("%d ",itr->data);
    }
    int main()
    {
        int size,itr,num,pos,val;
        scanf("%d",&size);
        for(itr=1;itr<=size;itr++)
        {
            scanf("%d",&num);
            create(num);
        }
        scanf("%d%d",&val,&pos);
        if(pos<1 || pos>size+1)
        {
            printf("Invalid input");
            return 0;
        }
        insertion(val, pos, size);
        display();
        return 0;
    }
}