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

using PII = pair<int, int>;
#define F first
#define S second
constexpr int maxn = 2e5 * 2 + 10;
int64_t k;
int n, a[maxn], f[maxn], g[maxn];

int main() {
  scanf("%d%lld", &n, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    a[i + n] = a[i];
  }
  unordered_map<int, int> m;
  for (int i = n * 2; i >= 1; --i) {
    if (m.count(a[i])) {
      f[i] = m[a[i]] + 1;
    } else {
      f[i] = i;
    }
    m[a[i]] = i;
  }
  f[n * 2 + 1] = n * 2 + 1;
  for (int i = n * 2 + 1; i >= 1; --i) {
    g[i] = i == f[i] ? f[i] : g[f[i]];
  }
  int s = n + 1;
  m.clear();
  int cnt = 0;
  while (k-- > 0) {
    s = g[s] - n;
    cnt++;
    if (m.count(s)) {
      int len = cnt - m[s];
      k %= len;
    }
    m[s] = cnt;
  }
  unordered_set<int> vis;
  vector<int> st;
  for (int i = s; i <= n; ++i) {
    if (vis.count(a[i])) {
      while (st.back() != a[i]) {
        vis.erase(st.back());
        st.pop_back();
      }
      vis.erase(st.back());
      st.pop_back();
    } else{
      vis.insert(a[i]);
      st.push_back(a[i]);
    }
  }
  for (size_t i = 0; i < st.size(); ++i)
    printf("%d%c", st[i], " \n"[i + 1 == st.size()]);
  return 0;
}

