#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

template<class T>
vector<T> shrink(vector<T> a, vector<T>& b){
  b = a;
  sort(b.begin(), b.end());
  b.erase( unique(b.begin(), b.end()), b.end());
  for(int i=0; i<(int)a.size(); i++){
    a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
  }
  return a;
}

void simulate(long long n, long long k, vector<int> A){
  vector<int> v;
  vector<vector<int>> vstack(*max_element(A.begin(), A.end()) + 1);
  for(long long i=0; i<n*k; i++){
    long long x = A[i%n];
    if(vstack[x].size() == 0){
      vstack[x].push_back(v.size());
      v.push_back(x);
    }else{
      long long j = vstack[x].front();
      while(v.size() > j){
        long long y = v.back();
        v.pop_back();
        vstack[y].pop_back();
      }
    }
    eprintln("turn :", i%n, ", v = ", v);
  }
}

long long get_loop(long long n, vector<int>& A, vector<vector<int>>& B, vector<int>& C){
  long long res = 0;
  int head_i = 0;
  for(; ;){
    long long x = A[head_i];
    int tail_i = B[x][(C[head_i] + 1) % B[x].size()];
    long long d = (tail_i - head_i + n) % n;
    if(d == 0) d = n;
    d += 1;
    res += d;
    head_i = (tail_i+1) % n;
    if(head_i == 0){
      break;
    }
  }
  return res;
}

void solve(int head_i, long long n, __int128 k, vector<int>& A, vector<vector<int>>& B, vector<int>& C, vector<int>& ans){
  if(k == 0) return;

  for(; k>0;){
    long long x = A[head_i];
    int tail_i = B[x][(C[head_i] + 1) % B[x].size()];
    long long d = (tail_i - head_i + n) % n;
    if(d == 0) d = n;
    d += 1;

    if(d > k){
      ans.push_back(x);
      solve((head_i+1) % n, n, k-1, A,B,C,ans);
      return;
    }

    k -= d;
    head_i = (tail_i+1) % n;
    if(head_i == 0){
      break;
    }
  }

}

int main(){
  long long n,k;
  cin >> n,k;

  vector<int> a(n);
  cin >> a;

  vector<int> b;
  auto A = shrink<int>(a, b);

  vector<vector<int>> B(b.size());
  vector<int> C(n);
  for(int i=0; i<n; i++){
    B[A[i]].push_back(i);
    C[i] = B[A[i]].size()-1;
  }

  // simulate(n, k, A);

  long long len = get_loop(n, A, B, C);

  eprintln("loop len =", len);

  __int128 K = k;
  K *= n;

  K %= len;
  vector<int> ans;
  solve(0, n, K, A, B, C, ans);

  for(int i=0; i<ans.size(); i++){
    ans[i] = b[ans[i]];
  }

  println(ans);

  return 0;
}


Measured memory_bytes: 38392