import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static int[] arrayLeftRotation(int[] a, int n, int k) {
        int move_count = k;
            int[] b = new int[n];
            while (move_count>n)
                move_count = move_count - n;
            for(int cnt = 0; cnt<n; cnt ++){
                int check = cnt - move_count;
                if (check<0){
                    int loc = n + check;
                    b[loc] = a[cnt];
                }
                else
                    b[check] = a[cnt];
            }
            return b;


    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int a[] = new int[n];
        for(int a_i=0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }

        int[] output = new int[n];
        output = arrayLeftRotation(a, n, k);
        for(int i = 0; i < n; i++)
            System.out.print(output[i] + " ");

        System.out.println();



    }
}