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

 typedef struct node{
    int data ;
    struct node *next;
}Node;

Node *head=NULL,*tail=NULL,*temp=NULL;

int create(int val){
    Node *newNode = (Node*)malloc(sizeof(Node));
    newNode->data=val;
    
    if(head==NULL){
        head=tail=newNode;
    }
    else{
        tail->next=newNode;
        tail =newNode;
    }
}
void display(){
    temp=head;
    while(temp->next!=NULL){
        printf("%d ",temp->data);
        temp=temp->next;
    }
    
}
void insertion(){
    int element,pos;
    scanf("%d",&element);
    scanf("%d",&pos);
    
    Node *newNode = (Node*)malloc(sizeof(Node));
    newNode->data=element;
    
    if(pos==1){
        newNode->next=head;
        head=newNode;
        return;
        display();
     }
    
     Node *i,*prev=NULL;
      temp=head;
     for( i=1 ; i<pos-1&& i!=NULL;i=i->next){
          temp=head;
          prev=temp;
          temp=temp->next;
         }
         
         prev->next=newNode;
         newNode->next=temp;
    }




int main(){
    int n,val;
    scanf("%d",&n);
    
    for(int i=0 ; i<n ;i++){
        scanf("%d",&val);
        create(val);
    }
        insertion();
    
    return 0;
}