//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

vi solve(int n, int k, vi a) {
    vi big(n);
    int last_diff_idx = n - 1;
    bool last_big = false;
    for (int i = n - 2; i >= 0; i--) {
        if (a[i + 1] > a[i]) {
            big[i + 1]++;
            last_diff_idx = i;
            last_big = true;
        } else if (a[i + 1] < a[i]) {
            big[i] += n - 1 - i;
            big[i + 1] -= n - 1 - i;
            last_diff_idx = i;
            last_big = false;
        } else {
            if (last_big) {
                big[i + 1]++;
            } else {
                big[i] = big[i + 1];
                big[i + 1] = 1;
                if (last_diff_idx + 1 < n) {
                    big[last_diff_idx + 1]--;
                }
            }
        }
        // DEBUG_VEC(big);
    }

    rep(i, n - 1) {
        big[i + 1] += big[i];
    }
    // DEBUG_VEC(big);
    rep(i, n) {
        if (big[i] == n - k) {
            vi ret;
            rep(j, n) {
                if (i == j) {
                    continue;
                }
                ret.push_back(a[j]);
            }
            return ret;
        }
    }
    assert(false);
}

vi guchoku(int n, int k, vi a) {

    vii zen;
    rep(i, n) {
        vi ret;
        rep(j, n) {
            if (i == j) {
                continue;
            }
            ret.push_back(a[j]);
        }
        zen.push_back(ret);
    }
    sort(all(zen));

    return zen[k - 1];
}

struct dice {
    mt19937 mt;
    dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
    // [0, x)の一様乱数
    ll operator()(ll x) { return this->operator()(0, x); }
    // [x, y)の一様乱数
    ll operator()(ll x, ll y) {
        uniform_int_distribution<ll> dist(x, y - 1);
        return dist(mt);
    }
    vl operator()(int n, ll x, ll y) {
        vl res(n);
        for (int i = 0; i < n; i++)
            res[i] = this->operator()(x, y);
        return res;
    }
} rnd;

signed main() {
    while (true) {
        int n, k;
        cin >> n >> k;
        // n = rnd(1, 5);
        // k = rnd(1, n + 1);

        vi a(n);
        rep(i, n) {
            cin >> a[i];
            // a[i] = rnd(1, n + 1);
        }

        // DEBUG(n);
        // DEBUG(k);
        // DEBUG_VEC(a);

        vi ans = solve(n, k, a);
        rep(i, n - 1) {
            cout << ans[i] << " ";
        }
        cout << endl;
        return 0;

        vi gu = guchoku(n, k, a);
        DEBUG_VEC(ans);
        DEBUG_VEC(gu);

        assert(ans == gu);
    }
}