import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, 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; }

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)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const K = readInt;
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt;
      }
      
      auto nxt = new int[N + 1];
      nxt[N] = N;
      foreach_reverse (i; 0 .. N) {
        nxt[i] = (i + 1 < N && A[i] == A[i + 1]) ? nxt[i + 1] : (i + 1);
      }
      
      int cmp(int i, int j) {
        if (i == j) return 0;
        if (i > j) return -cmp(j, i);
        if (nxt[i] <= j) return (A[nxt[i]] < A[i]) ? -1 : (A[nxt[i]] > A[i]) ? +1 : 0;
        return 0;
      }
      debug {
        foreach (i; 0 .. N) foreach (j; 0 .. N) {
          writefln("cmp %s %s = %s", i, j, cmp(i, j));
        }
      }
      
      auto js = iota(N).array;
      js.sort!((i, j) => (cmp(i, j) < 0));
      debug {
        writeln("js = ", js);
      }
      int ou;
      foreach (i; 0 .. N) if (i != js[K - 1]) {
        if (ou++) write(" ");
        write(A[i]);
      }
      writeln;
    }
  } catch (EOFException e) {
  }
}