#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N, K;
  IN(N,K);
  vll A(N);
  REP(i,N) IN(A[i]);

  unordered_map<ll, ll> mp1;
  vll next_index(2*N);
  REP(i,2*N){
    ll ii = i%N;
    if(mp1.find(A[ii])!=mp1.end()){
      next_index[mp1[A[ii]]] = i+1;
    }
    mp1[A[ii]] = i;
  }


  RREP(i,N-1){
    if(next_index[i]<N){
      next_index[i] = next_index[next_index[i]];
    }
  }

  /*
  REP(i,N){
    debug_print(i, next_index[i]);
  }
  */

  vll shift(N, 0);

  REP(i,N){
    if(next_index[i]>=2*N){
      shift[i] = 2;
    }else{
      shift[i] = 1;
    }
    next_index[i]%=N;
  }

  vvpll par(N, vpll(50));

  REP(i,N){
    par[i][0] = make_pair(next_index[i], shift[i]);
  }
  REP(j,49){
    REP(i,N){
      ll tmp1 = par[par[i][j].first][j].first;
      ll tmp2 = par[i][j].second + par[par[i][j].first][j].second;
      par[i][j+1] = make_pair(tmp1, tmp2);
    }
  }

  ll pos = 0;
  K--;
  RREP(i,49){
    if(par[pos][i].second>K) continue;
    K -= par[pos][i].second;
    pos = par[pos][i].first;
    //debug_print(pos, K);
  }

  deque<ll> que;
  unordered_map<ll, ll> mp2;
  for(ll i=pos; i<N*(K+1); ++i){
    if(mp2[A[i%N]]>0){
      while(mp2[A[i%N]]>0){
        ll tmp = que.back(); que.pop_back();
        mp2[tmp]--;
      }
    }else{
      que.push_back(A[i%N]);
      mp2[A[i%N]]++;
    }
  }

  while(que.size()>0){
    ll tmp = que.front(); que.pop_front();
    printf("%lld ", tmp);
  }
  printf("\n");

  return 0;
}

Measured memory_bytes: 190024