#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <map>
#include <set>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N, K;
  cin >> N >> K;
  vector<Z> as(N);
  cin >> as;
  map<Z, set<Z>> poss;
  for (auto i = 0; i < N; i++)
    poss[ix(as, i)].insert({i, i + N});
  vector<Z> nexts(N);
  for (auto i = 0; i < N; i++)
    ix(nexts, i) = *poss[ix(as, i)].upper_bound(i);
  dump(nexts);
  vector<Z> jumps = {};
  Z current_start = 0,
    length = 0;
  do  {
    jumps.push_back(current_start);
    Z next_start = ix(nexts, current_start) + 1;
    length += next_start - current_start;
    current_start = next_start % N;
  } while (current_start != 0);
  dump(jumps);
  dump(length);
  Z rest = (N * K) % length;
  dump(rest);
  Z js;
  for (js = 0; js < jumps.size() - 1; js++) {
    Z diff = ix(nexts, ix(jumps, js)) + 1 - ix(jumps, js);
    if (rest < diff) break;
    rest -= diff;
  }
  dump(js);
  dump(rest);
  map<Z, set<Z>> indices;
  vector<Z> raw(rest);
  for (auto i = 0; i < rest; i++) {
    Z a = ix(as, (i + ix(jumps, js)) % N);
    ix(raw, i) = a;
    indices[a].insert(i);
  }
  Z pos = 0;
  vector<Z> ans;
  while (pos < raw.size()) {
    auto next = indices[ix(raw, pos)].upper_bound(pos);
    if (next == end(indices[ix(raw, pos)])) {
      ans.push_back(ix(raw, pos));
      pos++;
      continue;
    }
    pos = *next + 1;
  }
  cout << ans << endl;
}



Measured memory_bytes: 75248