import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;
enum LIM = 3 * 10^^5;
enum E = 60;

int N;
long K;
int[] A;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readLong();
      A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      debug {
        writeln("A = ", A);
      }
      
      debug {
        {
          int[] s;
          foreach (k; 0 .. 10) {
            foreach (i; 0 .. N) {
              int pos = -1;
              foreach (j; 0 .. cast(int)(s.length)) {
                if (s[j] == A[i]) {
                  pos = j;
                  break;
                }
              }
              if (pos == -1) {
                s ~= A[i];
              } else {
                s = s[0 .. pos];
              }
              // writeln(s);
            }
            // writeln("----");
            // writeln(s);
          }
          // writeln("====");
        }
      }
      
      auto f = new long[][](E, N);
      
      auto app = new int[LIM];
      app[] = -1;
      foreach_reverse (i; 0 .. 2 * N) {
        if (i < N) {
          f[0][i] = app[A[i % N]] + 1;
        }
        app[A[i % N]] = i;
      }
      
      foreach (e; 1 .. E) {
        foreach (i; 0 .. N) {
          if (f[e - 1][i] >= INF) {
            f[e][i] = INF;
          } else {
            const j = cast(int)(f[e - 1][i] % N);
            f[e][i] = (f[e - 1][i] - j) + f[e - 1][j];
          }
        }
      }
      debug {
        foreach (e; 0 .. 3) {
          writeln(f[e]);
        }
      }
      
      long now = 0;
      foreach_reverse (e; 0 .. E) {
        const i = cast(int)(now % N);
        if ((now - i) + f[e][i] <= N * K) {
          now = (now - i) + f[e][i];
        }
        debug {
          // writeln("now = ", now);
        }
      }
      assert(now >= N * (K - 2));
      
      int len;
      auto seq = new int[N];
      auto pos = new int[LIM];
      len = 0;
      pos[] = -1;
      for (; now < N * K; ++now) {
        const i = cast(int)(now % N);
        if (pos[A[i]] != -1 && pos[A[i]] < len && seq[pos[A[i]]] == A[i]) {
          len = pos[A[i]];
        } else {
          pos[A[i]] = len;
          seq[len++] = A[i];
        }
      }
      
      foreach (j; 0 .. len) {
        if (j > 0) {
          write(" ");
        }
        write(seq[j]);
      }
      writeln();
    }
  } catch (EOFException e) {
  }
}


Measured memory_bytes: 108176