#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>a(n), ans;
	rep(i, n)cin >> a[i];
	int pre = a[0];//選ばなかったやつ？
	rep(i, n - 1) {
		if (pre < a[i + 1]) {
			if (k > (n - 1 - i)) {//n-1-i
				rep2(j, i, n - 1) ans.push_back(a[j + 1]);
				break;
			}
			else {
				ans.push_back(pre);
				pre = a[i + 1];
			}
		}
		else {
			if (1 < k) {//n-1-i
				ans.push_back(pre);
				pre = a[i + 1];
				k -= 1;
			}
			else {
				rep2(j, i, n - 1) ans.push_back(a[j + 1]);
				break;
			}
		}
	}
	rep(i, ans.size())cout << ans[i] << " ";
	cout << endl;
	return 0;
}