#include <iostream>
#include <deque>
#include <vector>

class WorkerShiftUsingDeque {
public:
    void process() {
        int N, S;
        std::cin >> N;
        if (N < 1 || N > 100) {
            std::cout << "Invalid input";
            return;
        }
        std::deque<int> dq;
        for (int i = 0; i < N; ++i) {
            int num;
            std::cin >> num;
            if (num < 0 || num > 1000) {
                std::cout << "Invalid input";
                return;
            }
            dq.push_back(num);
        }
        std::cin >> S;
        if (S < 0 || S > 100) {
            std::cout << "Invalid input";
            return;
        }
        S = S % N; // Only rotate if needed
        for (int i = 0; i < S; ++i) {
            int last = dq.back();
            dq.pop_back();
            dq.push_front(last);
        }
        for (int i = 0; i < N; ++i) {
            std::cout << dq[i];
            if (i != N-1) std::cout << " ";
        }
    }
};

int main() {
    WorkerShiftUsingDeque wsud;
    wsud.process();
    return 0;
}