#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;

int N, K, ans=-1;
vector<int> A;

int main(){
    cin >> N >> K;
    A.resize(N);
    for (int i=0; i<N; i++) cin >> A[i];

    for (int i=0; i<N; i++){
        if (A[i+1] <= A[i]){
            if (K == 1){
                ans = i;
                break;
            }
            else K--;
        }
        else{
            if (K == N-i){
                ans = i;
                break;
            }
        }
    }
    if (ans == -1) ans = N-1;

    for (int i=0; i<N; i++) if (ans != i) cout << A[i] << " ";
    cout << endl;

    return 0;
}