#include<iostream>
using namespace std;
int tmp;
int s[105];
int n,m;
//reverse[p,q)
void reverse(int *p,int *q){
for(int *p1=p,*p2=q-1;p1<p2;++p1,--p2)
{tmp=*p1; *p1=*p2; *p2=tmp;}
}
int main(){
cin>>n>>m;
m=((m>n)?m%n:m);
for(int i=0;i<n;++i)cin>>s[i];
reverse(s+n-m,s+n);
reverse(s,s+n-m);
reverse(s,s+n);
for(int i=0;i<n;++i)
{if(!i)cout<<s[i];else cout<<' '<<s[i];}
return 0;}