#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
vector<pair<int, int> > cnt;
int k, num;
bool check(int mid) {
  int need = k;
  for (int i = 0; i < num; i++) {
    int tmp = cnt[i].first / mid;
    if (need == 0) return true;
    if (tmp >= 1) {
      if (need > tmp)
        need -= tmp;
      else
        return true;
    } else
      return false;
  }
  if (need > 0)
    return false;
  else
    return true;
}
void solve() {
  int n;
  cin >> n >> k;
  set<int> s;
  for (int i = 0; i < N; i++) cnt.push_back({0, i});
  for (int i = 0; i < n; i++) {
    int p;
    cin >> p;
    cnt[p].first++;
    s.insert(p);
  }
  num = s.size();
  sort(cnt.rbegin(), cnt.rend());
  int l = 1, r = N, ans = 1;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid)) {
      l = mid + 1;
      ans = mid;
    } else
      r = mid - 1;
  }
  vector<int> v;
  for (int i = 0; i < N; i++) {
    if (k <= 0) break;
    int tmp = cnt[i].first / ans;
    if (k >= tmp) {
      for (int j = 0; j < tmp; j++) v.push_back(cnt[i].second);
      k -= tmp;
    } else {
      for (int j = 0; j < k; j++) v.push_back(cnt[i].second);
      k = 0;
    }
  }
  for (int i : v) cout << i << ' ';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) solve();
}
