//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr usize operator"" _z(unsigned long long x) noexcept {
  return static_cast<usize>(x);
}

class rep {
  const usize f, l;

public:
  class itr {
    friend rep;
    usize i;
    constexpr itr(const usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
  constexpr itr begin() const noexcept { return itr(f); }
  constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
  const usize f, l;

public:
  class itr {
    friend revrep;
    usize i;
    constexpr itr(usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
  constexpr itr begin() const noexcept { return itr(l); }
  constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
  return a < b ? b - a : a - b;
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <functional>
#include <utility>

namespace n91 {

template <class T, class U, class Operate = std::multiplies<T>>
constexpr T power(T base, U exp, const Operate &oper = Operate(),
                  T iden = static_cast<T>(1)) {
  while (exp != static_cast<U>(0)) {
    if (exp % static_cast<U>(2) != static_cast<U>(0)) {
      iden = oper(iden, base);
    }
    exp /= static_cast<U>(2);
    base = oper(base, base);
  }
  return iden;
}

} // namespace n91

#include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <utility>

namespace n91 {

void main_() {
  static constexpr usize max = 200001;
  const usize n = scan<usize>();
  const u64 k = scan<u64>();
  std::vector<usize> a;
  a.reserve(n);
  std::copy_n(std::istream_iterator<usize>(std::cin), n, std::back_inserter(a));

  using p = std::vector<usize>;

  p sigma(max);

  //*
  {
    std::map<usize, usize> map;

    std::vector<usize> rem(n + 1_z);

    for (const auto i : revrep(0_z, n)) {
      const usize e = a[i];
      if (map.count(e)) {
        rem[i] = rem[map[e] + 1_z];
      } else {
        rem[i] = e;
      }
      map[e] = i;
    }

    sigma[0_z] = rem[0_z];
    for (const auto e : a) {
      sigma[e] = rem[map[e] + 1_z];
    }
  }
  //*/

  const auto cu = power(sigma, k - static_cast<u64>(1),
                        [](const p &l, const p &r) {
                          p ret(max);
                          for (const auto i : rep(0_z, max)) {
                            ret[i] = r[l[i]];
                          }
                          return ret;
                        },
                        []() {
                          p ret(max);
                          std::iota(ret.begin(), ret.end(), 0_z);
                          return ret;
                        }());
  const usize top = cu[0_z];

  std::set<usize> set;
  std::vector<usize> ans;

  usize fst = 0_z;
  if (top != 0_z) {
    for (const auto i : rep(0_z, n)) {
      if (a[i] == top) {
        fst = i + 1_z;
        break;
      }
    }
  }

  for (const auto i : rep(fst, n)) {
    if (set.count(a[i])) {
      while (ans.back() != a[i]) {
        set.erase(ans.back());
        ans.pop_back();
      }
      set.erase(ans.back());
      ans.pop_back();
    } else {
      ans.push_back(a[i]);
      set.insert(a[i]);
    }
  }

  for (const auto e : ans) {
    std::cout << e << " ";
  }
  std::cout<<std::endl;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 17408