#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
map<int, int> M;
priority_queue<pair<int, int> > pq;
vector<int> fn;
inline void build(int n) {
  for (int i = int(0); i < int(n); ++i) {
    int k;
    cin >> k;
    M[k]++;
  }
  for (auto val : M) pq.push({val.second, val.first});
}
inline bool f(int rep, int t) {
  priority_queue<pair<int, int> > q = pq;
  fn.clear();
  for (int i = int(0); i < int(t); ++i) {
    pair<int, int> val = q.top();
    q.pop();
    if (val.first < rep) return false;
    q.push({val.first - rep, val.second});
    fn.push_back(val.second);
  }
  return true;
}
inline int solve(int n, int t) {
  int a = 1, b = n + 1;
  int mid;
  while (a + 1 != b) {
    mid = (a + b) / 2;
    if (f(mid, t))
      a = mid;
    else
      b = mid;
  }
  f(a, t);
  return a;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, t;
  cin >> n >> t;
  build(n);
  int ans = solve(n, t);
  for (int v : fn) cout << v << " ";
  cout << endl;
  return 0;
}
