#include <iostream>

#include <cstring>

#include <algorithm>

#include <queue>

#include <vector>

#include <cstdio>

#include <malloc.h>

#define INF 0x3f3f3f3f

#define FRER() freopen("in.txt", "r", stdin)

#define FREW() freopen("out.txt", "w", stdout)

using namespace std;

const int maxn = 1e6 + ;

int num[maxn];

void adjust(int s, int m) {

    int temp = num[s];

    for(int j = s * ; j <= m; j *= ) {

        if(j < m && num[j] > num[j + ]) ++j;

        if(temp <= num[j]) break;

        num[s] = num[j];

        s = j;

    }

    num[s] = temp;

}

void heapSort(int n) {

    for(int i = n / ; i > ; --i)

        adjust(i, n);

    for(int i = n; i > ; --i) {

        swap(num[], num[i]);

        adjust(, i - );

    }

}

int main()

{

    int n, m;

    scanf("%d %d", &n, &m);

    for(int i = ; i <= n; ++i)

        scanf("%d", &num[i]);

    heapSort(n);

    for(int i = ; i <= m && i <= n; ++i) {

        printf("%d%c", num[i], (i == m || i == n) ? '\n' : ' ');

    }

    return ;

}