#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>//fixed,setprecision
//#include <limits.n>//INT_MAX
//#include <math.n>//M_PI
#include <random>
#include <regex> // 正規表現
#include <time.h>
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
using mint = modint998244353;
//using mint=modint;
//using P=pair<int,int>;
//contain(string s,string v) sにvが含まれるかを判定
template<class T, class U>
bool contain(const std::basic_string<T>& s, const U& v) {
   return s.find(v) != std::basic_string<T>::npos;
}
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
//解説見た　写し　難しい～
int main(){
  int n,k;
  cin>>n>>k;
  k--;
  map<vector<int>,int>mp;
  vector<int>a(n);
  rep(i,n)cin>>a[i];
  vector<int>p(n);
  queue<int>q;
  int l=0,r=n-1;
  rep(i,n-1){
    q.push(i);
    if(a[i]>a[i+1]){
      while(!q.empty()){
        p[l++]=q.front();q.pop();
      }
    }else if(a[i]<a[i+1]){
      while(!q.empty()){
        p[r--]=q.front();q.pop();
      }
    }
  }
  q.push(n-1);
  while(!q.empty()){
    p[l++]=q.front();q.pop();
  }
  vector<int>ans;
  rep(i,n){
    if(i==p[k])continue;
    ans.push_back(a[i]);
  }
  rep(i,n-1){
    cout<<ans[i]<<" ";
  }
  cout<<endl;
  return 0;
}