import java.util.Scanner;

class Node {
    int data;
    Node next;

    Node(int data) {
        this.data = data;
        this.next = null;
    }
}

public class CircularListRotation {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        if (n < 0) {
            System.out.println("Invalid input");
            return-1;
        }

        Node head = null;
        Node tail = null;

        for (int i = 0; i < n; i++) {
            int value = sc.nextInt();
            Node newNode = new Node(value);
            if (head == null) {
                head = newNode;
                tail = newNode;
            } else {
                tail.next = newNode;
                tail = newNode;
            }
        }

        tail.next = head;

        int k = sc.nextInt();
        k = k % n;
        if (k < 0) {
            k += n;
        }

        Node current = head;
        for (int i = 0; i < n - k - 1; i++) {
            current = current.next;
        }

        head = current.next;
        current.next = head;

        Node temp = head;
        for (int i = 0; i < k; i++) {
            System.out.print(temp.data + " ");
            temp = temp.next;
        }
        System.out.println();
    }
}