Attendance Check

Teacher Neringa has devised a new way to check whether all students have gathered for class. There are $N$ students in the class, and each student is assigned to remember the name of exactly one other student.

Each day before class, Neringa randomly picks one student and calls that student's name. The student who is called then calls the name of the student assigned to them; that student in turn calls the name of the student assigned to them; and so on, until some student calls the name of the student Neringa originally called.

Neringa set up the assignments (deciding who remembers whose name) so that, when every student is present, calling the students this way is guaranteed to call each student exactly once. In other words, the assignments form a single cycle that includes all students.

Determine which student responds last, assuming all students are present.

The first line contains two positive integers: the number of students $N$ and the number $k$ of the student Neringa calls.

The second line contains $N$ positive integers $a_1, a_2, \dots, a_N$, where $a_i$ is the number of the student assigned to student $i$.

Print a single integer — the number of the last student to respond.

• $1 \le N,\ k \le 1000$
• $1 \le a_i \le N$ for every $i$.
• All $a_i$ are distinct.