#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>
using namespace std; using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()
#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )
#define MP make_pair
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
void dfs( const VI &P, VI &depth, VI &sizes, const int u, const int d = 0 )
{
if ( sizes[u] != -1 )
{
return;
}
if ( depth[u] != -1 )
{
sizes[u] = d - depth[u];
}
depth[u] = d;
dfs( P, depth, sizes, P[u], d + 1 );
return;
}
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
int N, A;
cin >> N >> A;
--A;
string K;
cin >> K;
VI P( N );
cin >> P;
transform( ALL( P ), begin( P ), bind( minus< int >(), _1, 1 ) );
if ( SZ( K ) <= 6 )
{
for ( int k = fromString< int >( K ); k; --k )
{
A = P[A];
}
cout << A + 1 << endl;
return 0;
}
VI depth( N, -1 ), sizes( N, -1 );
dfs( P, depth, sizes, A );
for ( ; sizes[A] == -1; A = P[A] );
const int dist = depth[A];
int m = 0;
FOR( c, K )
{
m *= 10;
m += c - '0';
m %= sizes[A];
}
m = ( ( m - dist ) % sizes[A] + sizes[A] ) % sizes[A];
for ( ; m; --m )
{
A = P[A];
}
cout << A + 1 << endl;
return 0;
}