// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
// #include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i,n) for(ll i=0; i<(n); i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define ALL(n) begin(n),end(n)
#define IN(a, x, b) (a<=x && x<b)
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T & a, const T b) { return a = (a > b) ? b : a; }

const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
const long long MOD = 1000000007;

ll is_visited[200010];
ll aciton_de_visit_town[200010];

int main(void){
    ll ans =0;

    ll n;
    ll k;
    ll direction[200010];
    ll loop_started=1;
    ll now_town=1;
    ll action =1;
    is_visited[1] = 1;
    aciton_de_visit_town[action] = 1;

    cin >> n >> k ;
    REP(i,n){
        ll tmp;
        cin >> tmp;
        direction[i+1] = tmp;
    }

    if( k < n){ // 閉路検出不要なら気合い入れて計算
        REP(i,k){
            ans = direction[now_town];
            now_town = direction[now_town];
        }
    }else{ // 閉路が必ずあること前提
        while(1){
            // 移動
            now_town = direction[now_town];
            action++;
            aciton_de_visit_town[action] = now_town;
            if( is_visited[now_town] ){
                // 訪れ済みなら閉路検出
                break;
            }
            is_visited[now_town] = action;
        }

        //残ってる移動回数を算出
        ll move_num = k-(action-1);
        //閉路での移動数を算出
        ll loop_move_num = action - is_visited[now_town];
        ll mod = move_num % loop_move_num;
        ans = aciton_de_visit_town[ is_visited[now_town] + mod];
    }

    cout << ans <<endl;

    return 0;
}

Measured memory_bytes: 7480