#include <bits/stdc++.h>
using namespace std;
struct keycompare {
  bool operator()(const pair<long long, long long>& v, const long long& k) {
    return (v.first < k);
  }
  bool operator()(const long long& k, const pair<long long, long long>& v) {
    return (k < v.first);
  }
};
long long mod1 = 998244353, mod2 = 1000000007, limit = 9223372036854775807;
long long modpow(long long x, long long n, long long m) {
  if (n == 0) return 1 % m;
  long long u = modpow(x, n / 2, m);
  u = (u * u) % m;
  if (n % 2 == 1) u = (u * x) % m;
  return u;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool isprime(long long n) {
  if (n == 2) return true;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
long long k;
bool check(long long copies, multiset<long long> st) {
  long long count = 0;
  while (*--st.end() >= copies & count < k) {
    long long temp = *--st.end();
    count++;
    st.erase(st.find(temp));
    st.insert(temp - copies);
  }
  if (count == k) {
    return true;
  } else {
    return false;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n >> k;
  long long arr[n + 1];
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  arr[n] = 300000;
  sort(arr, arr + n);
  long long freq = 1;
  multiset<long long> st;
  multiset<pair<long long, long long>> ans;
  for (long long i = 1; i < n + 1; i++) {
    if (arr[i - 1] == arr[i]) {
      freq++;
    } else {
      st.insert(freq);
      ans.insert({freq, arr[i - 1]});
      freq = 1;
    }
  }
  long long left = 1, right = n;
  while (left < right) {
    long long mid = (left + right + 1) / 2;
    if (check(mid, st)) {
      left = mid;
    } else {
      right = mid - 1;
    }
  }
  while (k--) {
    cout << (*--ans.end()).second << " ";
    long long aa = (*--ans.end()).first, bb = (*--ans.end()).second;
    ans.erase({aa, bb});
    ans.insert({aa - left, bb});
  }
}
