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

int N, K;
int A[200010];

int rec(int l, int r, int k, int i) {
    // cout << l << " " << r << " " << k << " " << i << endl;
    if (i==N-1) return l;
    if (A[i+1]<A[i]) {
        if (k<=i-l+1) return rec(l, i, k, i+1);
        else return rec(i+1, r, k-(i-l+1), i+1);
    } else if (A[i+1]>A[i]) {
        if (k>r-i) return rec(l, i, k-(r-i), i+1);
        else return rec(i+1, r, k, i+1);
    } else return rec(l, r, k, i+1);
}

int main() {
    cin.tie(0); ios::sync_with_stdio(false);
    
    cin >> N >> K;
    rep(i, N) cin >> A[i];
    int x = rec(0, N-1, K, 0);
    vector<int> B;
    rep(i, N) if (i!=x) B.pb(A[i]);
    rep(i, N-1) {
        if (i<N-1) cout << B[i] << " ";
        else cout << B[i] << endl;
    }
}