#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  i64 N, K; cin >> N >> K;
  vi32 A(N); cin >> A;
  vi32 a;
  {
    int cnt = 1;
    int prev = A[0];
    reps(i, N - 1) {
      if (A[i] == prev) cnt++;
      else {
        if (cnt % 2 == 1) a.push_back(prev);
        cnt = 1;
        prev = A[i];
      }
    }
    if (cnt % 2 == 1) a.push_back(prev);
  }
  int n = a.size();
  if (n == 0) {
    cout << "" << '\n';
    return;
  }
  vi32 next(n, -1);
  {
    map<int, int> ma;
    rep(i, n) {
      if (ma.count(a[i])) {
        next[ma[a[i]]] = i;
      }
      ma[a[i]] = i;
    }
    map<int, int> me;
    rep(i, n) {
      if (next[i] != -1 && me.count(a[i]) == 0) {
        me[a[i]] = i;
      } else if (next[i] == -1) {
        if (me.count(a[i])) {
          next[i] = -me[a[i]];
        } else {
          next[i] = -ma[a[i]];
        }
      }
    }
  }
  vi32 sta;
  unordered_set<int> se;
  sta.push_back(0);
  se.insert(0);
  int now = 0;
  while (true) {
    bool fin = false;
    while (next[now] > 0) {
      now = next[now];
      now = (now + 1) % n;
      if (now == 0) {
        fin = true;
        break;
      }
    }
    if (fin) break;
    now = -next[now];
    now = (now + 1) % n;
    if (se.count(now) > 0) break;
    sta.push_back(now);
    se.insert(now);
  }
  {
    unordered_set<int> se;
    rep(i, n) se.insert(a[i]);
    if (se.size() == n) {
      sta.push_back(-1);
    }
  }
  now = sta[(K - 1) % sta.size()];
  if (now == -1) {
    cout << "" << '\n';
    return;
  }
  vi32 ans;
  while (now < n) {
    if (next[now] > 0) {
      now = next[now];
      now++;
    } else {
      ans.push_back(a[now++]);
    }
  }
  cout << ans << '\n';
}


Measured memory_bytes: 20120