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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), 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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

using pt = pair<ll, int>;
pt nex[60][200010];

int main(int argc, char const* argv[])
{
  ll n, k; cin >> n >> k;
  vector<ll> a(n); cin >> a;
  map<ll, int> mp;
  map<ll, int> fir;
  rep(i, n){
    if(fir.find(a[i]) == fir.end())fir[a[i]] = i;
  }
  rrep(i, n){
    if(mp.find(a[i]) == mp.end())nex[0][i] = mk(1, fir[a[i]] + 1);
    else nex[0][i] = mk(0, mp[a[i]] + 1);
    if(nex[0][i].second == n){
      nex[0][i].first++;
      nex[0][i].second = 0;
    }
    mp[a[i]] = i;
  }

  for(int k = 1; k < 50; k++){
    rep(i, n){
      ll fi = nex[k-1][i].first;
      ll curr = nex[k-1][i].second;
      nex[k][i].first = fi;
      nex[k][i].second = nex[k-1][curr].second;
      nex[k][i].first += nex[k-1][curr].first;
    }
  }
  /*
  rep(k, 4){
    rep(i, n){
      cerr << i << "->(" << (1 << k) << "): " << nex[k][i].first << " " << nex[k][i].second << endl;
    }
  }
  */
  ll kc = 0;
  int now = 0;
  for(int i = 49; i >= 0; i--){
    ll nc = nex[i][now].first;
    int nowc = nex[i][now].second;
    ll sum = nc + kc;
    if(sum > k - 1)continue;
    kc += nc;
    now = nowc;
  }
  if(kc == k){
    cout << endl;
    return 0;
  }
  vector<int> res;
  //cerr << kc << " " << now << endl;
  while(now < n){
    if(nex[0][now].first >= 1 && !(nex[0][now].first == 1 && nex[0][now].second == 0)){
      res.pb(a[now]);
      now++;
    }else{
      if(nex[0][now].first >= 1)break;
      now = nex[0][now].second;
    }
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 186744