object Main {
  import java.io.{BufferedReader, InputStream, InputStreamReader}
  import java.util.StringTokenizer
  import scala.reflect.ClassTag

  def main(args: Array[String]): Unit = {
    val out = new java.io.PrintWriter(System.out)
    new Main(out, new InputReader(System.in)).solve()
    out.flush()
  }

  private val oj = System.getenv("ATCODER_DEBUG") == null
  def DEBUG(f: => Unit): Unit = {
    if (!oj){ f }
  }
  def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) }
  def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) }
  def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) }
  def debugDim(m: Array[Array[Long]]): Unit = if (!oj){
    REP(m.length) { i =>
      debug(m(i))
    }
  }
  def debugDimFlip(m: Array[Array[Long]]): Unit = if (!oj){
    REP(m(0).length) { j =>
      REP(m.length) { i =>
        System.err.print(m(i)(j))
        System.err.print(" ")
      }
      System.err.println()
    }
  }
  def debug(s: => String): Unit = DEBUG {
    System.err.println(s)
  }
  def debugL(num: => Long): Unit = DEBUG {
    System.err.println(num)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = Integer.parseInt(next())
    def nextLong(): Long = java.lang.Long.parseLong(next())
    def nextChar(): Char = next().charAt(0)

    def ni(): Int = nextInt()
    def nl(): Long = nextLong()
    def nc(): Char = nextChar()
    def ns(): String = next()
    def ns(n: Int): Array[Char] = ns().toCharArray
    def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
    def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
      val A1, A2 = Array.ofDim[Int](n)
      REP(n) { i =>
        A1(i) = ni() + offset
        A2(i) = ni() + offset
      }
      (A1, A2)
    }
    def nm(n: Int, m: Int): Array[Array[Int]] = {
      val A = Array.ofDim[Int](n, m)
      REP(n) { i =>
        REP(m) { j =>
          A(i)(j) = ni()
        }
      }
      A
    }
    def nal(n: Int): Array[Long] = map(n)(_ => nl())
    def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  }

  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }
  def TO(from: Int, to: Int)(f: Int => Unit): Unit = {
    REP(to - from + 1, from) { i =>
      f(i)
    }
  }
  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }

  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }
  def cumSum(as: Array[Int]): Array[Long] = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}

class Main(out: java.io.PrintWriter, sc: Main.InputReader) {
  import sc._
  import Main._
  import java.util.Arrays.sort

  import scala.collection.mutable
  import math.{abs, max, min}
  import mutable.ArrayBuffer

  // toIntとか+7とかするならvalにしろ
  @inline private def MOD = 1000000007

  def solve(): Unit = {
    val N = ni()
    val K = nl()
    val A = na(N)
    val T = Array.ofDim[Int](N + 1)
    val empty = 0
    T(N) = empty

    val MAX = 2e5.toInt
    val last = Array.fill[Int](MAX + 1)(-1)
    REP_r(N) { i =>
      if (last(A(i)) == -1) {
        T(i) = A(i)
      } else {
        T(i) = T(last(A(i)) + 1)
      }
      last(A(i)) = i
    }
    debug(T)

    val visited = Array.ofDim[Boolean](MAX + 1)
    val path = ArrayBuffer[(Int, Int)]() // (値, 場所)
    var p = empty
    path += 0 -> N
    while(!visited(p)) {
      val next_i = if (p == 0) {
        0
      } else {
        last(p) + 1
      }
      val next = T(next_i)
      visited(p) = true
      p = next
      path += next -> next_i
    }

    debug(path.mkString(" "))

    def makeCycle(path: ArrayBuffer[(Int, Int)]): (ArrayBuffer[(Int, Int)], Int) = {
      val t = path.last._1
      val i = path.dropRight(1).indexWhere(_._1 == t)
      (path.slice(i, path.length - 1), i)
    }

    val (g, offset) = makeCycle(path)
    debug(g.mkString(" "))
    debug(s"offset:$offset")

    val i = if (K <= offset) {
      path(offset)._2
    } else {
      val p = ((K - offset) % g.length).toInt
      debug(s"p:$p")
      g(p)._2
    }

    def simulate(s: Int): String = {
      val last = Array.fill[Int](MAX + 1)(-1)
      val ans = Array.ofDim[Int](N)
      var p = 0
      TO(s, N - 1) { i =>
        if (last(A(i)) == -1) {
          last(A(i)) = p
          ans(p) = A(i)
          p += 1
        } else {
          val p1 = last(A(i))
          TO(last(A(i)), p - 1) { j =>
            last(ans(j)) = -1
          }
          p = p1
        }
        debug(last.take(10))
        debug(ans)
        debug(s"p:$p")
      }
      ans.take(p).mkString(" ")
    }

    debug(s"i:$i")

    out.println(simulate(i))
  }
}

Measured memory_bytes: 86912