{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq N$\n*   $1 \\leq K \\leq 10^{18}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\dots$ $A_N$"},{"iden":"sample input 1","content":"4 5\n3 2 4 1"},{"iden":"sample output 1","content":"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$."},{"iden":"sample input 2","content":"6 727202214173249351\n6 5 2 5 3 2"},{"iden":"sample output 2","content":"2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}