//  小根堆
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1E5 + 10;
int a[N];
int n, m;
void down(int u){
    int t = u;
    if(u * 2 <= n && a[u * 2] < a[t])   t = u * 2;
    if(u * 2 + 1 <= n && a[u * 2 + 1] < a[t])   t = u * 2 + 1;
    if(t != u){
        swap(a[t], a[u]);
        down(t);
    }
}
int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i ++ )   scanf("%d", &a[i]);
    for(int i = n / 2; i; i -- )   down(i);
    for(int i = 1; i <= m; i ++ ){
        cout << a[1];
        if(i == m)  cout << endl;
        else    cout << " ";
        a[1] = a[n -- ];
        down(1);
    }
    return 0;
}