#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,k,hold,temp;
cin>>n>>k;
ll arr[n];
unordered_map<int,int>map;
for(ll i=0;i<n;i++)
{
cin>>arr[i];
map.insert(make_pair(arr[i],i));
}
ll m=0;
while(m<n && k>0)
{
hold=map[n-m];
if(hold==m)
{
m++;
continue;
}
else
{
temp=arr[m];
arr[m]=arr[hold];
arr[hold]=temp;
map.insert(arr[hold],hold);
map.insert(arr[m],m);
m++;
k–;
}
}
for(auto x:arr)
cout<<x<<" ";
return 0;
}