#line 1 "c.cpp" #include #include #define rep(i,n) for (int i = 0; i < int(n); ++i) #define repp(i,n,m) for (int i = m; i < int(n); ++i) #define reb(i,n) for (int i = int(n)-1; i >= 0; --i) #define all(v) v.begin(),v.end() using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using PL = pair; using pdd = pair; using pil = pair; using pli = pair; templateistream &operator>>(istream &is,vector &v){for(auto &e:v)is>>e;return is;} templatebool range(T a,T b,T x){return (a<=x&&xbool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));} template T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; } templatebool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;} templatebool chmax(T &a,const T &b){if(avoid uniq(vector &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());} templatevoid print(pair a); templatevoid print(vector v); templatevoid print(vector> v); void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(char a){ printf("%c", a); } void print(char a[]){ printf("%s", a); } void print(const char a[]){ printf("%s", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } void print(unsigned int a){ printf("%u", a); } void print(unsigned long long a) { printf("%llu", a); } template void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template int out(const T& t){ print(t); putchar('\n'); return 0; } template int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } templatevoid print(pair a){print(a.first);print(),print(a.second);} templatevoid print(vector v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}} templatevoid print(vector> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}} void yes(){out("Yes");} void no (){out("No");} void yn (bool t){if(t)yes();else no();} void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout< dx = {0,1,0,-1,1,1,-1,-1}; const vector dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; } // namespace noya2 //using namespace noya2; //using mint = modint998244353; using mint = modint1000000007; //using mint = modint; void out(mint a){out(a.val());} void out(vector a){vector b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);} void out(vector> a){for (auto v : a) out(v);} istream &operator>>(istream &is,vector &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;} vector aa(int n, int k, vector a){ vector b; vector c; vector d; int pre = a[0], cnt = 0, id = 0; a.emplace_back(n+100); rep(i,n+1){ if (pre == a[i]){ cnt++; continue; } b.emplace_back(pre); c.emplace_back(id); d.emplace_back(cnt); pre = a[i]; id = i; cnt = 1; } int s = n-1; int siz = c.size(); int sum = 0; rep(i,siz-1){ if (b[i] > b[i+1]){ if (k <= d[i]){ s = c[i]; break; } k -= d[i]; } else { if (k > n-sum-d[i]){ s = c[i]; break; } } sum += d[i]; } vector ans; rep(i,n) if (i != s) ans.emplace_back(a[i]); return ans; } vector ac(int n, int k, vector a){ int s = n-1; rep(i,n-1){ if (a[i] > a[i+1]){ if (k == 1){ s = i; break; } k--; } else if (a[i] < a[i+1]){ if (k == n-i){ s = i; break; } } else if (i == n-2) break; else { if (a[i+2] == a[i]) continue; if (a[i+2] < a[i]){ if (k == 1){ s = i; break; } k--; } else { if (k == n-i){ s = i; break; } } } } vector ans; rep(i,n) if (i != s) ans.emplace_back(a[i]); return ans; } void gu(int n, vector a){ vector> b(n); rep(i,n){ rep(j,n) if (j != i) b[i].emplace_back(a[j]); } sort(all(b)); vector> c(n); rep(i,n) c[i] = aa(n,i+1,a); if (b != c){ out(a); out(b); out(); out(c); out(); } } void solve(){ int n, k; cin >> n >> k; vector a(n); cin >> a; out(aa(n,k,a)); } /* void solve(){ int n, k; cin >> n >> k; vector a(n); cin >> a; int s = n-1; rep(i,n-1){ if (a[i] > a[i+1]){ if (k == 1){ s = i; break; } k--; } else if (a[i] < a[i+1]){ if (k == n-i){ s = i; break; } } else if (i == n-2) break; else { if (a[i+2] == a[i]) continue; if (a[i+2] < a[i]){ if (k == 1){ s = i; break; } k--; } else { if (k == n-i){ s = i; break; } } } } vector ans; rep(i,n) if (i != s) ans.emplace_back(a[i]); out(ans); } //*/ /* #include"random_testcase_generator.hpp" void solve(){ int t; cin >> t; while (t--){ int n = rnd.next(3,10); vector a = random_vector(n,1,5); gu(n,a); } } //*/ int main(){ fast_io(); int t = 1; //cin >> t; while(t--) solve(); }