#include <stdio.h>
#include <stdlib.h>
struct Node {
    int data;
    struct Node* next;
};
struct Node* createNode(int data) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}
int main() {
    int n;
    scanf("%d", &n);
    if(n < 1 || n > 100) {
        printf("Invalid input");
        return 0;
    }
    struct Node* head = NULL;
    struct Node* tail = NULL;
    for (int i = 0; i < n; i++) {
        int value;
        scanf("%d", &value);
        if (value <- 1000 || value > 1000) {
            printf("Invalid input");
            return 0;
        }
        struct Node* newNode = createNode(value);
        if (head == NULL) {
            head = newNode;
            tail = newNode;
        } else {
            tail->next = newNode;
            tail = newNode;
        }
    }
    int newValue, pos;
    scanf("%d", &newValue);
    scanf("%d", &pos);
    if (newValue < -1000 || newValue > 1000) {
        printf("Invalid input");
        return 0;
    }
    if (pos < 1 || pos > n + 1) {
        printf("Invalid input");
        return 0;
    }
    if (pos == 1) {
        newNode->next = head;
        head = newNode;
    } else {
        struct Node* temp = head;
        for (int i = 1; i < pos - 1; i++) {
            temp = temp->next;
        }
        newNode->next = temp->next;
        temp->next = newNode;
    }
        struct Node* temp = head;
        while (temp != NULL) {
            printf("%d", temp->data);
            if (temp->next != NULL) printf(" ");
            temp = temp->next;
        }
        return 0;
    }