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

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

#define int long long

vector<int> topological_sort(vector<vector<int>> g) {
    int n = g.size();
    vector<int> indeg(n, 0);
    for(int i = 0; i < n; i++) {
        for(auto e : g[i]) {
            indeg[e]++;
        }
    }
    queue<int> que;
    for(int i = 0; i < n; i++) if(indeg[i] == 0) que.push(i);
    vector<int> ans;
    while(!que.empty()) {
        int v = que.front();
        ans.push_back(v);
        que.pop();
        for(auto e : g[v]) {
            indeg[e]--;
            if(indeg[e] == 0) {
                que.push(e);
            }
        }
    }
    return ans;
}

void solve() {
    int n, k;
    cin >> n >> k;
    vi s(n);
    FOR(n) cin >> s[i];
    vi ans(n);
    iota(all(ans), 0);
    sort(all(ans), [&](int i, int j) {
        if(i < j) {
            if(s[i] < s[i+1]) return true;
            return false;
        }else {
            if(s[j] < s[j+1]) return true;
            return false;
        }
    });
    FOR(n) if(ans[k-1] != i) cout << s[i] << " "; cout << "\n";
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}