#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int T;
  T = 1;
  while (T--) solve();
}

// https://atcoder.jp/contests/abc167/submissions/13097435
void solve() {
  int n;
  ll k;
  cin >> n >> k;
  vector<int> a(n);
  cin >> a;
  rep(i, n) a[i]--;
  vector<vector<int> > G(n);
  rep(i, n) {
    G[i].eb(a[i]);
  }

  if (k <= 10000000) { // ループ前に終わる, debuged
    int now = 0;
    rep(i, k) now = a[now];
    cout << now + 1 << endl;
    return;
  }
    
  vector<int> seen(n);
  int pos = -1; // cycle 中に含まれる頂点 pos
  stack<int> hist; // 訪問履歴
  auto dfs = [&](auto&& dfs, int v, int p) -> void {
    seen[v] = 1;
    hist.push(v);
    for (auto nv : G[v]) {
      // if (nv == p) continue; directed ならいらない, undirected なら 2 頂点ループは見つけられない
      if (seen[nv] == 2) continue;
      if (seen[nv] == 1) { // cycle を検出
        pos = nv;
        return;
      }
      dfs(dfs, nv, v);
      if (pos != -1) return;
    }
    hist.pop();
    seen[v] = 2;
  };
  dfs(dfs, 0, -1);
  if (pos != -1) { // cycle
    // 経路復元, cycle に限らず
    vector<int> cycle;
    while (!hist.empty()) {
      int t = hist.top();
      cycle.eb(t);
      hist.pop();
      if (t == pos) break;
    }
    reverse(all(cycle));
    // cout << cycle << endl;

    int now = 0, cnt = 0;
    rep(i, n) {
      if (now == cycle[0]) {
        cnt = i;
        break;
      }
      now = a[now];
      if (i == k) {
        cout << now + 1 << endl;
        return;
      }
    }
    // cout << "cnt " << cnt << endl;

    k %= sz(cycle);
    // cout << k << endl;
    (k = k - cnt % sz(cycle) + sz(cycle)) %= sz(cycle); 
    
    cout << cycle[k] + 1 << endl;
  }


}


Measured memory_bytes: 26500