#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
  distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
  distance(v.begin(), upper_bound(v.begin(), v.end(), x))

using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;

ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};

/* Macros reg. ends here */

const ll INF = 1LL << 50;

static const long long mod = 1000000007;

struct mint {
  ll x;  // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

class modutils {
  vector<mint> fact, invfact;

 public:
  modutils(int n = 200005) : fact(n + 1), invfact(n + 1) {
    fact[0] = 1;
    for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;
    invfact[n] = fact[n].inv();
    for (int i = n; i >= 1; i--) invfact[i - 1] = invfact[i] * i;
  }
  mint pow(mint x, ll n) { return x.pow(n); }
  mint comb(ll n, ll k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fact[n] * invfact[k] * invfact[n - k];
  }
  mint perm(ll n, ll k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fact[n] * invfact[n - k];
  }
  mint fac(ll n) { return fact[n]; }
};

ll n, k;
void dfs(ll i, vll& endi, vll& to) {
  if (to[i] == -1) {
    endi[i] = i;
  } else if (to[i] == n) {
    endi[i] = n;
  } else if (endi[to[i]] != -1) {
    endi[i] = endi[to[i]];
  } else {
    dfs(to[i], endi, to);
    endi[i] = endi[to[i]];
  }
}

int main() {
  // ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cout << fixed << setprecision(15);

  cin >> n >> k;

  vll as(n);
  rep(i, n) cin >> as[i];

  if (n == 1) {
    if (k % 2 == 1) {
      cout << as[0] << endl;
    }
    return 0;
  }

  vll to(n, -1);
  map<ll, ll> a2i;  // the idx where a appears for the first time.
  map<ll, ll> lasti;
  rep(i, n) {
    if (a2i.count(as[i]) == 0) a2i[as[i]] = i;
    if (lasti.count(as[i]) != 0) to[lasti[as[i]]] = i + 1;
    lasti[as[i]] = i;
  }

  vll endi(n, -1);
  rep(i, n) { dfs(i, endi, to); }

  vvll dbl(50, vll(n + 1, -1));
  rep(i, 50) {
    rep(j, n + 1) {
      if (i == 0) {
        if (j == n) {
          dbl[i][j] = 0;
        } else {
          ll e = endi[j];
          if (e == n)
            dbl[i][j] = 0;
          else {
            ll ai = a2i[as[e]];
            dbl[i][j] = ai + 1;
          }
        }
      } else {
        dbl[i][j] = dbl[i - 1][dbl[i - 1][j]];
      }
    }
  }

  k--;
  ll cur = 0;
  rrepLRE(i, 49, 0) {
    if ((k >> i) & 1) {
      cur = dbl[i][cur];
    }
  }

  vll ans;
  while (cur < n) {
    if (to[cur] == -1) {
      ans.push_back(as[cur]);
      cur++;
    } else {
      cur = to[cur];
      if (cur == 0) break;
    }
  }

  rep(i, (ll)ans.size()) cout << ans[i]
                              << ((i == (ll)ans.size() - 1) ? '\n' : ' ');

  return 0;
}


Measured memory_bytes: 114660