#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ ll N, K; cin >> N >> K; ll left = 1; ll right = N; vl A(N); rep(i,N){ cin >> A[i]; } vpll rle(0); rle.push_back(pll(A[0], 1)); for (ll i = 1; i < N; i++){ if (A[i] == A[i - 1]){ rle[rle.size() - 1].second++; } else{ rle.push_back(pll(A[i], 1)); } } for (ll i = 0; i < rle.size() - 1; i++){ if (rle[i].first > rle[i + 1].first){ left += rle[i].second; if (left > K){ rle[i].second--; break; } } else if (rle[i].first < rle[i + 1].first){ right -= rle[i].second; if (right < K){ rle[i].second--; break; } } } if (left <= K && K <= right){ rle[rle.size() - 1].second--; } vl ans(0); for (ll i = 0; i < rle.size(); i++){ for (ll j = 0; j < rle[i].second; j++){ ans.push_back(rle[i].first); } } rep(i,ans.size()){ cout << ans[i] << " "; } cout << endl; }