/**
 *    author:  tourist
 *    created: 21.07.2019 15:40:37       
**/
#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  long long k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  const int MAX = 200010;
  vector<int> nxt(MAX, -1);
  vector<int> first_on_suffix(n + 1);
  first_on_suffix[n] = -1;
  for (int i = n - 1; i >= 0; i--) {
    if (nxt[a[i]] != -1) {
      first_on_suffix[i] = first_on_suffix[nxt[a[i]] + 1];
    } else {
      first_on_suffix[i] = a[i];
    }
    nxt[a[i]] = i;
  }
  int wut = -1;
  long long steps = 0;
  while (k > 1) {
    ++steps;
    if (wut == -1) {
      wut = first_on_suffix[0];
    } else {
      wut = first_on_suffix[nxt[wut] + 1];
    }
    --k;
    if (wut == -1) {
      k = (k - 1) % steps + 1;
    }
  }
  vector<vector<int>> occ(MAX);
  vector<int> b;
  int start = (wut == -1 ? 0 : nxt[wut] + 1);
  for (int i = start; i < n; i++) {
    int x = a[i];
    if (occ[x].empty()) {
      occ[x].push_back((int) b.size());
      b.push_back(x);
    } else {
      while (!occ[x].empty()) {
        occ[b.back()].pop_back();
        b.pop_back();
      }
    }
  }
  for (int i = 0; i < (int) b.size(); i++) {
    if (i > 0) {
      cout << " ";
    }
    cout << b[i];
  }
  cout << '\n';
  return 0;
}


Measured memory_bytes: 15604