import java.util.Scanner

import scala.annotation.tailrec

object Main {
  def main(args: Array[String]): Unit = {
    //nextLineとnextを同時に使ったら死ぬ
    val sc = new Scanner(System.in)

    val n = sc.nextInt()
    val k = sc.nextLong()
    val as = Vector.fill(n)(sc.nextInt())

    @scala.annotation.tailrec
    def dfs(now: Int,
            set: Set[Int] = Set.empty[Int],
            acc: Vector[Int] = Vector()): Vector[Int] = {
      if (set.contains(now)) acc :+ now
      else {
        dfs(as(now) - 1, set + now, acc :+ now)
      }
    }

    val m = dfs(0)
    val last = m.last
    val l = m.takeWhile(_ != last)
    val s = m.dropWhile(_ != last).init

    val ans = {
      if (k < l.length) {
        l(k.toInt) + 1
      } else {
        if (l.isEmpty) {
          val mm = k % s.length
          val an = if (mm == s.length) 0 else mm
          s(an.toInt) + 1
        } else {
          val more = k - l.length + 1
          val mm = more % s.length

          val mmm =
            if (mm == 0) s.length else mm - 1

          s(mmm.toInt) + 1
        }
      }
    }

    println(ans)
  }

  //region

  def debug(args: Any*): Unit = {
    Console.err.println(args.mkString(" "))
  }

  def printExecTime(process: => Unit): Unit = {
    val start = System.currentTimeMillis
    process
    debug("処理時間： " + (System.currentTimeMillis - start) + " ミリ秒")
  }

  def bitSearch[T](n: Int, choice: Vector[T]): Vector[Vector[T]] = {
    @tailrec
    def bitSearchLogic(n: Int,
                       choice: Vector[T],
                       acc: Vector[Vector[T]]): Vector[Vector[T]] = {
      if (n == 0) acc
      else {
        val newAcc =
          acc.flatMap(vec => {
            choice.map(c => vec :+ c)
          })
        bitSearchLogic(n - 1, choice, newAcc)
      }
    }

    val firstAcc = choice.map(i => Vector(i))
    bitSearchLogic(n - 1, choice, firstAcc)
  }
  //endregion
}
