using System;
using System.Collections.Generic;

namespace AtCoder.Problems
{
    public class ProblemD
    {
        public static void Main(string[] args)
        {
            var s = new SolveD();
            s.Solve();
        }

        public class Scanner
        {
            private string[] _s;
            private int _i;
            private readonly char[] _separators = new char[] { ' ' };

            public Scanner()
            {
                _s = new string[0];
                _i = 0;
            }

            public string Next()
            {
                if (_i < _s.Length) return _s[_i++];
                string st = Console.ReadLine();
                while (st == "") st = Console.ReadLine();
                _s = st.Split(_separators, StringSplitOptions.RemoveEmptyEntries);
                if (_s.Length == 0) return Next();
                _i = 0;
                return _s[_i++];
            }

            public int NextInt() => int.Parse(Next());
            public long NextLong() => long.Parse(Next());
            public ulong NextULong() => ulong.Parse(Next());
            public double NextDouble() => double.Parse(Next());

            public int[] GetIntArray(int n, int add = 0)
            {
                int[] array = new int[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextInt() + add;
                }
                return array;
            }

            public long[] GetLongArray(int n, long add = 0)
            {
                long[] array = new long[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextLong() + add;
                }
                return array;
            }

            public double[] GetDoubleArray(int n, double add = 0)
            {
                double[] array = new double[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextDouble() + add;
                }
                return array;
            }

            public string[] GetStringArray(int n)
            {
                string[] array = new string[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = Next();
                }
                return array;
            }
        }
    }

    public class SolveD
    {
        public void Solve()
        {
            var cin = new ProblemD.Scanner();
            var n = cin.NextInt();
            var k = cin.NextLong();
            var a = cin.GetIntArray(n);

            var result = GetAnswer(n, k, a);
            Console.WriteLine(result);
        }

        public int GetAnswer(int n, long k, int[] a)
        {
            var ans = 1;

            var list = new List<int>(n + 1);
            var dp = new bool[n + 1];
            while (k > 0)
            {
                // リストにある場合は循環回数の剰余を出す
                if (dp[ans])
                {
                    var index = list.IndexOf(ans);
                    var count = list.Count - index;
                    k %= count;

                    return list[index + (int)k];
                }

                // リストにないので単純に1つ進んでリストに追加
                dp[ans] = true;
                list.Add(ans);
                ans = a[ans - 1];
                --k;
            }

            return ans;
        }
    }
}


Measured memory_bytes: 43236