#include <bits/stdc++.h>
using namespace std;
using ii = pair<long long int, long long int>;
class prioritize {
 public:
  bool operator()(ii &p1, ii &p2) { return p1.first < p2.first; }
};
long long int power(long long int n, long long int y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return power(n, y / 2) * power(n, y / 2);
  else
    return n * power(n, y / 2) * power(n, y / 2);
}
long long maxPrimeFactors(long long n) {
  long long maxPrime = -1;
  while (n % 2 == 0) {
    maxPrime = 2;
    n >>= 1;
  }
  for (int i = 3; i <= sqrt(n); i += 2) {
    while (n % i == 0) {
      maxPrime = i;
      n = n / i;
    }
  }
  if (n > 2) maxPrime = n;
  return maxPrime;
}
long long int spf(long long int n) {
  if (n % 2 == 0)
    return 2;
  else {
    for (long long int i = 3; i <= sqrt(n); i += 2) {
      if (n % i == 0) return i;
    }
  }
  return n;
}
map<long long int, long long int> m;
vector<long long int> v;
bool checker(long long int val, long long int k) {
  v.clear();
  for (auto it : m) {
    long long int x = it.second;
    long long int z = min(x / val, k - int(v.size()));
    while (z--) {
      v.push_back(it.first);
    }
  }
  if (int(v.size()) >= k)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  long long int arr[n];
  for (long long int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    m[x]++;
    arr[i] = x;
  }
  long long int begin = 1;
  long long int end = n;
  long long int mid = 0;
  vector<long long int> w;
  long long int ans = 0;
  if (k == n) {
    for (long long int i = 0; i < n; i++) {
      cout << arr[i] << " ";
    }
    cout << "\n";
  } else {
    while (end >= begin) {
      mid = begin + ((end - begin) / 2);
      if (checker(mid, k)) {
        ans = max(ans, mid);
        if (mid == ans) {
          w = v;
        }
        begin = mid + 1;
      } else {
        end = mid - 1;
      }
    }
    for (auto it : w) {
      cout << it << " ";
    }
    cout << "\n";
  }
}
