#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n,k;
  cin>>n>>k;
  vector<int> A(n);
  rep(i,n) cin>>A[i];
  
  deque<int> deq;
  rep(i,n) deq.push_back(i+1);
  
  vector<int> C;
  int tmp=0;
  rep(i,n-1){
    tmp++;
    if(A[i]<A[i+1]){
      while(tmp){
        auto t=deq.back();
        deq.pop_back();
        C.push_back(t);
        tmp--;
      }
    }
    else if(A[i]>A[i+1]){
      while(tmp){
        auto t=deq.front();
        deq.pop_front();
        C.push_back(t);
        tmp--;
      }
    }
  }
  
  while(deq.size()){
    auto t=deq.front();
    deq.pop_front();
    C.push_back(t);
  }

  vector<int> ANS;
  rep(i,n){
    if(C[i]==k) continue;
    ANS.push_back(A[i]);
  }
  rep(i,n-1){
    if(i) cout<<" ";
    cout<<ANS[i];
  }
  cout<<endl;

  return 0;
}