#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, K, c;
    cin >> N >> K; K--;
    vector<int> A(N), p(N, -1), q;
    deque<int> v(N);
    for (int i=0; i<N; i++) v[i] = i;
    for (int i=0; i<N; i++) cin >> A[i];

    for (int i=0; i<N-1; i++){
        q.push_back(i);
        if (A[i] == A[i+1]) continue;
        if (A[i] < A[i+1]){
            while(!q.empty()){
                c = q.back();
                q.pop_back();
                p[c] = v.back();
                v.pop_back();
            }
        }
        else{
            while(!q.empty()){
                c = q.back();
                q.pop_back();
                p[c] = v.front();
                v.pop_front();
            }
        }
    }

    while(!q.empty()){
        c = q.back();
        q.pop_back();
        p[c] = v.front();
        v.pop_front();
    }
    for (int i=0; i<N; i++) if (p[i] == -1) p[i] = v[0];

    for (int i=0; i<N; i++){
        if (K == p[i]) continue;
        cout << A[i] << " ";
    }
    cout << endl;

    return 0;
}