//g++ 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

// [l,r)
void solve(int n,int l,int r,int k,vi &a){
  if(n==1){
    return;
  }
  if(a[l]>a[l+1]){
    if(k==1){
      rep(i,l+1,r)cout<<a[i]<<" ";
      return;
    }
    cout<<a[l]<<" ";
    solve(n-1,l+1,r,k-1,a);
    return;
  }
  if(a[l]<a[l+1]){
    if(k==n){
      rep(i,l+1,r)cout<<a[i]<<" ";
      return;
    }
    cout<<a[l]<<" ";
    solve(n-1,l+1,r,k,a);
    return;
  }

  cout<<a[l]<<" ";
  if(k==n){
    solve(n-1,l+1,r,k-1,a);
    return;
  }
  solve(n-1,l+1,r,k,a);
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n,k;cin>>n>>k;
  vi a(n);
  rep(i,0,n)cin>>a[i];

  solve(n,0,n,k,a);
}