#line 2 "lib/template.cpp"

#ifndef LOCAL
#pragma GCC diagnostic warning "-w"
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
constexpr int INF = 1000000007;
constexpr ll INF_LL = 1'000'000'000'000'000'007;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define newl '\n'

// loops rep(until) / rep(var, until) / rep(var, from, until) / repr (reversed order)
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define rep(...) OVERLOAD3(__VA_ARGS__, REPEAT_FROM_UNTIL, REPEAT_UNTIL, REPEAT)(__VA_ARGS__)
#define REPEAT(times) REPEAT_CNT(_repeat, __COUNTER__, times)
#define REPEAT_CNT(_repeat, cnt, times) REPEAT_CNT_CAT(_repeat, cnt, times)
#define REPEAT_CNT_CAT(_repeat, cnt, times) REPEAT_FROM_UNTIL(_repeat ## cnt, 0, times)
#define REPEAT_UNTIL(name, times) REPEAT_FROM_UNTIL(name, 0, times)
#define REPEAT_FROM_UNTIL(name, from, until) for (int name = from, name ## __until = (until); name < name ## __until; name++)
#define repr(...) OVERLOAD3(__VA_ARGS__, REPR_FROM_UNTIL, REPR_UNTIL, REPEAT)(__VA_ARGS__)
#define REPR_UNTIL(name, times) REPR_FROM_UNTIL(name, 0, times)
#define REPR_FROM_UNTIL(name, from, until) for (int name = (until)-1, name ## __from = (from); name >= name ## __from; name--)

template <typename T, typename U>
bool chmin(T& var, U x) { if (var > x) { var = x; return true; } else return false; }
template <typename T, typename U>
bool chmax(T& var, U x) { if (var < x) { var = x; return true; } else return false; }
ll power(ll e, ll t, ll mod = INF_LL) {
  ll res = 1; for (; t; t >>= 1, (e *= e) %= mod) if (t & 1) (res *= e) %= mod; return res;
}
ll choose(ll n, int r) {
  chmin(r, n-r); if (r < 0) return 0; ll res = 1; rep(i, r) res *= n-i, res /= i+1; return res;
}
template <typename T, typename U> T divceil(T m, U d) { return (m + d - 1) / d; }
template <typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

// debugging stuff
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmisleading-indentation"
#define repi(it, ds) for (auto it = ds.begin(); it != ds.end(); it++)
class DebugPrint { public: template <typename T> DebugPrint& operator <<(const T& v) {
#ifdef LOCAL
    cerr << v;
#endif
return *this; } } debugos; template <typename T> DebugPrint& operator<<(DebugPrint& os, const
vector<T>& vec) { os << "{"; for (int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 ==
vec.size() ? "" : ", "); os << "}"; return os; } template <typename T, typename U> DebugPrint&
operator<<(DebugPrint& os, const map<T, U>& map_var) { os << "{"; repi(itr, map_var) { os << *
itr; itr++; if (itr != map_var.end()) os << ", "; itr--; } os << "}"; return os; } template <
typename T> DebugPrint& operator<<(DebugPrint& os, const set<T>& set_var) { os << "{"; repi(
itr, set_var) { os << *itr; itr++; if (itr != set_var.end()) os << ", "; itr--; } os << "}";
return os; } template <typename T, typename U> DebugPrint& operator<<(DebugPrint& os, const
pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; } void dump_func(
) { debugos << newl; } template <class Head, class... Tail> void dump_func(Head &&head, Tail
&&... tail) { debugos << head; if (sizeof...(Tail) > 0) { debugos << ", "; } dump_func(forward
<Tail>(tail)...); }
#ifdef LOCAL
#define dump(...) debugos << "  " << string(#__VA_ARGS__) << ": " << "[" << to_string(__LINE__) \
<< ":" << __FUNCTION__ << "]" << newl << "    ", dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
#pragma GCC diagnostic pop


#line 2 "lib/util/compress.cpp"

#line 4 "lib/util/compress.cpp"

template <typename T = ll>
class Compress {
 private:
  vector<T> data;
  bool built = false;

 public:
  Compress() {}
  template <typename Iter>
  Compress(Iter first, Iter last) : data(first, last) {
    build();
  }

 private:
  void build() {
    if (not built) {
      sort(data.begin(), data.end());
      data.erase(unique(data.begin(), data.end()), data.end());
      built = true;
    }
  }

 public:
  void insert(T v) {
    built = false;
    data.push_back(v);
  }
  template <typename... Args>
  void emplace(Args&&... args) {
    built = false;
    data.emplace_back(forward<Args>(args)...);
  }
  int size() {
    build();
    return data.size();
  }
  int operator()(T v) {
    build();
    assert(binary_search(data.begin(), data.end(), v));
    return std::lower_bound(data.begin(), data.end(), v) - data.begin();
  }
  T restore(int i) {
    build();
    return data[i];
  }
  T operator[](int i) { return restore(i); }
  auto begin() { build(); return data.begin(); }
  auto end() { build(); return data.end(); }
};
#line 2 "lib/util/doubling.cpp"

#line 2 "lib/util/mapping.cpp"

#line 4 "lib/util/mapping.cpp"

class Mapping {
 public:
  struct Combine {
    Mapping operator()(const Mapping& lhs, const Mapping& rhs) {
      if (lhs.f.empty()) return rhs;
      if (rhs.f.empty()) return lhs;
      assert(lhs.f.size() == rhs.f.size());
      int n = lhs.f.size();
      vector<int> f(n);
      rep(x, n) {
        int y = rhs.f[x];
        f[x] = 0 <= y and y < n ? lhs.f[y] : y;
      }
      return Mapping(move(f));
    }
  };

 private:
  vector<int> f;

 public:
  Mapping() = default;
  Mapping(int n) : f(n) { iota(all(f), 0); }
  Mapping(const vector<int>& f_) : f(f_) {}
  Mapping(vector<int>&& f_) : f(move(f_)) {}

  int operator()(int x) { return f[x]; }
};
#line 5 "lib/util/doubling.cpp"

template <typename T = Mapping, typename Combine = typename T::Combine>
class Doubling {
 private:
  vector<T> data;
  const T base;
  const T unit;
  const Combine combine;

 public:
  Doubling(T base_ = {}, T unit_ = {}, Combine combine_ = {})
      : data({base_}), base(base_), unit(unit_), combine(combine_) {}

 private:
  void prepare(ll n) {
    if (n <= 1) return;
    int need = 64 - __builtin_clz(n-1);
    rep(need - data.size()) data.push_back(combine(data.back(), data.back()));
  }

 public:
  T pow(ll exp) {
    prepare(exp);
    T res = unit;
    int i = 0;
    for (; exp > 0; exp >>= 1, i++)
      if (exp & 1) res = combine(res, data[i]);
    return res;
  }

  static T pow(T base, ll exp, T unit = {}, Combine combine = {}) {
    T res = unit;
    for (; exp; exp >>= 1, base = combine(base, base))
      if (exp & 1) res = combine(res, base);
    return res;
  }
};
#line 4 "main.cpp"

int main() {
  cin.tie(0);	ios_base::sync_with_stdio(false);

  int n; ll k; cin >> n >> k;
  VI a(n); rep(i, n) cin >> a[i];

  constexpr int MaxA = 200005;

  VVI ar(MaxA); rep(i, n) ar[a[i]].push_back(i);

  VI nxt(n); vector<int> skip(n);
  rep(i, n) {
    auto it = upper_bound(all(ar[a[i]]), i);
    if (it == ar[a[i]].end()) skip[i]++, it = ar[a[i]].begin();
    nxt[i] = *it + 1;
    if (nxt[i] >= n) skip[i]++, nxt[i] -= n;
  }

  VI when(n, -1);
  when[0] = 0;
  int now = 0;
  int at = 0;
  while (when[nxt[at]] == -1) when[nxt[at]] = now += skip[at], at = nxt[at];
  now += skip[at];
  at = nxt[at];

  int from;

  if (when[at] < k) {
    k -= when[at];
    k %= now - when[at];
    k += when[at];
    if (k == 0) k = now - when[at];
  }

  rep(i, n) if (when[i] == k-1) { from = i; break; }

  // dump(from, when, k);

  VI res;
  VB done(MaxA);
  rep(i, from, n) {
    if (done[a[i]]) {
      while (res.back() != a[i]) done[res.back()] = false, res.pop_back();
      res.pop_back();
      done[a[i]] = false;
    } else {
      res.push_back(a[i]);
      done[a[i]] = true;
    }
  }
  dump(res.size());
  rep(i, res.size()) cout << res[i] << " \n"[i == res.size() - 1];
}


Measured memory_bytes: 16504