#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
  {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
  {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
  {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
  #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
  #define dump(...)
  #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

signed main() {
  int n, K; cin >> n >> K;
  vector<int> a(n); REP (i, n) cin >> a[i];
  unordered_map<int, int> tmp;
  for (int i = n - 1; i >= 0; i--) tmp[a[i]] = i;
  vector<int> nxt(n + 1, 0);
  for (int i = n - 1; i >= 0; i--) {
    int nix = tmp[a[i]];
    dump(i, nix);
    if (i >= nix) {
      nxt[i] = nix + n + 1;
    } else {
      if (nix + 1 == n) nxt[i] = 0;
      else nxt[i] = nxt[nix + 1];
    }
    tmp[a[i]] = i;
  }
  REP (i, n) {
    if (nxt[i] >= n) nxt[i] -= n;
  }
  dump(nxt);

  auto simulate = [&](int x) {
    vector<int> s;
    unordered_set<int> st;
    REPI (i, x, n) {
      if (st.count(a[i])) {
        while (st.count(a[i])) {
          int y = s.back(); s.pop_back();
          st.erase(y);
        }
      } else {
        st.insert(a[i]);
        s.push_back(a[i]);
      }
    }
    for (int y : s) cout << y << " ";
    cout << endl;
  };

  int cur = 0;
  unordered_map<int, int> cnt;
  REP (i, n + 2) {
    dump(i, cur);
    if (cnt.count(cur)) {
      dump(i);
      int j = cnt[cur];
      int dif = i - j;
      int rem = (K - j) % dif;
      dump(j, rem);
      REP (r, rem - 1) j = nxt[j];
      dump(j);
      simulate(j);
      return 0;
    }
    cnt[cur] = i;
    cur = nxt[cur];
  }
  assert(0);
}


Measured memory_bytes: 31044