#include<algorithm>
using namespace std;
int n,k;
short a[500001];
void solve(){
    int i,st,dr;
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i)
        scanf("%d",&a[i]);
    for(st=1,dr=n; dr-st+1>k; )
        if(a[st]>a[dr])
            --dr;
        else
            ++st;
    for(i=st; i<=dr; ++i)
        printf("%d ",a[i]);}
int main(){
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    solve();
    return 0;}