{"problem":{"name":"Teleporter","description":{"content":"The Kingdom of Takahashi has $N$ towns, numbered $1$ through $N$. There is one teleporter in each town. The teleporter in Town $i$ $(1 \\leq i \\leq N)$ sends you to Town $A_i$. Takahashi, the king, lov","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc167_d"},"statements":[{"statement_type":"Markdown","content":"The Kingdom of Takahashi has $N$ towns, numbered $1$ through $N$.\nThere is one teleporter in each town. The teleporter in Town $i$ $(1 \\leq i \\leq N)$ sends you to Town $A_i$.\nTakahashi, the king, loves the positive integer $K$. The selfish king wonders what town he will be in if he starts at Town $1$ and uses a teleporter exactly $K$ times from there.\nHelp the king by writing a program that answers this question.\n\n## Constraints\n\n*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq N$\n*   $1 \\leq K \\leq 10^{18}$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\dots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc167_d","tags":[],"sample_group":[["4 5\n3 2 4 1","4\n\nIf we start at Town $1$ and use the teleporter $5$ times, our travel will be as follows: $1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4$."],["6 727202214173249351\n6 5 2 5 3 2","2"]],"created_at":"2026-03-03 11:01:14"}}