#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N,K; cin >> N >> K;
  vector<ll> A(N);
  rep(i,N) cin >> A[i];
  vector<int> B(N,N-1);
  int lo = 0;
  int hi = N-1;
  int car = 1;
  rep(i,N-1){
    if(A[i]==A[i+1]){
      car++;
    }
    if(A[i]<A[i+1]){
      rep(j,car){
        B[hi] = i-(car-1)+j;
        hi--;
      }
      car = 1;
    }
    else{
      rep(j,car){
        B[lo] = i-(car-1)+j;
        lo++;
      }
      car = 1;
    }
  }
  rep(i,car){
    B[hi] = N-1-i;
    hi--;
  }
  rep(i,N) if(i!=B[K-1]) cout << A[i] << ' ';
  cout << '\n';
  return 0;
}