#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

const int A = 222222;

int main() {
  ll n, k;
  cin >> n >> k;
  vl a(n);
  rep (i, n) cin >> a[i];

  vi last(A, -1);
  vi b(2*n);
  rep (i, n) {
    b[i] = b[i + n] = a[i];
  }

  for (int i = 2 * n - 1; i >= n; i--) {
    last[b[i]] = i;
  }

  vi next(n);
  rrep (i, n) {
    if (last[a[i]] >= n) {
      next[i] = last[a[i]] - n;
    }
    else {
      next[i] = last[a[i]];
    }
    last[a[i]] = i;
  }

  //DEBUG_VEC(next);
  
  map<int, int> start2cnt;
  bool is_loop = false;
  int cnt = 1;
  int idx = 0;
  while (cnt <= k - 1) {
    if (start2cnt[idx] != 0) {
      is_loop = true;
      break;
    }
    start2cnt[idx] = cnt;
    int tail_i = next[idx];
    if (tail_i <= idx) cnt++;
    idx = (tail_i + 1) % n;
    if (idx == 0) cnt++;
  }

  /*
  DEBUG(is_loop);
  DEBUG(idx);
  DEBUG(cnt);
  DEBUG(start2cnt[idx]);
  //*/
  
  if (not is_loop) {
    cnt = 1;
    idx = 0;
    while (cnt <= k - 1) {
      start2cnt[idx] = cnt;
      int tail_i = next[idx];
      if (tail_i <= idx) cnt++;
      idx = (tail_i + 1) % n;
    }
    vi ans;
    while (idx < n) {
      int tail_i = next[idx];
      if (tail_i <= idx) {
        ans.push_back(a[idx]);
        idx++;
      }
      else {
        idx = (tail_i + 1);
      }
    }

    rep (i, ans.size()) {
      cout << ans[i] << " ";
    }
    cout << endl;
    return 0;
  }
  
  //DEBUG(cnt);
  //DEBUG(idx);

  int diff = cnt - start2cnt[idx];
  k = (k - start2cnt[idx]) % diff + 1;
  
  cnt = 1;
  while (cnt <= k - 1) {
    start2cnt[idx] = cnt;
    int tail_i = next[idx];
    if (tail_i <= idx) cnt++;
    idx = (tail_i + 1) % n;
  }

  
  vi ans;
  while (idx < n) {
    int tail_i = next[idx];
    if (tail_i <= idx) {
      ans.push_back(a[idx]);
      idx++;
    }
    else {
      idx = (tail_i + 1);
    }
  }

  rep (i, ans.size()) {
    cout << ans[i] << " ";
  }
  cout << endl;
  
}


Measured memory_bytes: 16120