#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 0xffffff;
void Swap(int *a,int i,int j)
{
    int t = a[i];
    a[i] = a[j];
    a[j] = t;
}
int main()
{
    int n,m;
    scanf("%d %d",&n,&m);
    int a[n];
    for(int i=0;i<n;i++)
    scanf("%d",&a[i]);

    while(m--)
    {
        int idx = 0;
        for(int i=n-2;i>=0;i--)
        if(a[i] < a[i+1])
        {
            idx = i;
            break;
        }
        int idx2 = 0,Min = inf;
        for(int i=idx+1;i < n;i++)
        if(a[i] < Min &&  a[i] > a[idx])
        Min = a[i],idx2 = i;

        Swap(a,idx,idx2);
        sort(a+idx+1,a+n);
    }
    for(int i=0;i<n;i++)
    printf("%d ",a[i]);
    return 0;
}