#include <fstream>
#include <algorithm>

using namespace std;

ifstream cin ("sdo.in");
ofstream cout ("sdo.out");

#define MAX_n 500000
int v[MAX_n];


void quicksort (int stanga, int dreapta, int k)
{
    int pivot = v[stanga + rand() % (dreapta - stanga + 1)];

    int s = stanga, d = dreapta;

    while(v[s] < pivot)
        s++;

    while(v[d] > pivot)
        d--;

    while(s < d)
    {
        swap(v[s], v[d]);

        s++; d--;

        while(v[s] < pivot)
            s++;

        while(v[d] > pivot)
            d--;
    }

    if(stanga < d && k < d)
        quicksort(stanga, d, k);
    else if(dreapta > d + 1)
        quicksort(d + 1, dreapta, k);

}


int main()
{
    int n, k;
    cin >> n >> k;
    for(int i=0;i<n;i++)
    {
        cin >> v[i];
    }

    quicksort(0, n-1, k-1);

    for(int i=0;i<n;i++)
    {
        cout<<v[i] << " ";
    }

    return 0;
}