#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n,k;
vector<int> a;
using P = pair<int,int>;

void solve(){
	vector<P> vpii;
	{
		ll l = 1;
		for(int i = 0;i<n-1;i++){
			if(a[i]==a[i+1]){
				l++;
			}else{
				vpii.push_back(P(a[i],l));
				l=1;
			}
		}
		vpii.push_back(P(a.back(),l));
	}
	ll l = 1,r = n;
	for(int i = 0;i<vpii.size()-1;i++){
		if(vpii[i].first<vpii[i+1].first){
			r -= vpii[i].second;
		}else{
			l += vpii[i].second;
		}
		if(l<=k&&k<=r){
		}else{
			vpii[i].second--;
			break;
		}
	}
	if(l<=k&&k<=r)vpii.back().second--;
	for(auto &[l,r]:vpii){
		for(int j =0;j<r;j++)cout<<l<<' ';
	}
	cout<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n >> k;
	a = vector<int>(n);
	for(auto &i:a)cin >> i;
	solve();
}