text: // atcoder/abc167/D/mani.cpp
  // author: @___Johniel
  // github: https://github.com/johniel/
  
  #include <bits/stdc++.h>
  
  #define each(i, c) for (auto& i : c)
  #define unless(cond) if (!(cond))
  
  using namespace std;
  
  template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
  template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }
  template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }
  template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }
  template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; }
  template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; }
  
  template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
  template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }
  
  using lli = long long int;
  using ull = unsigned long long;
  using point = complex<double>;
  using str = string;
  template<typename T> using vec = vector<T>;
  
  constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1});
  constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1});
  constexpr lli mod = 1e9 + 7;
  
  const int N = 2 * 1e5 + 5;
  vec<int> g[N];
  lli cost[N];
  
  void rec(int curr, lli c)
  {
    cost[curr] = c;
    each (next, g[curr]) {
      if (cost[next] != -1) continue;
      rec(next, c + 1);
    }
    return ;
  }
  
  int main(int argc, char *argv[])
  {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.setf(ios_base::fixed);
    cout.precision(15);
  
    lli n;
    lli k;
    while (cin >> n >> k) {
      fill(g, g + N, vec<int>());
      for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        --x;
        g[i].push_back(x);
      }
  
      fill(cost, cost + N, -1);
      rec(0, 0);
  
      map<lli, lli> m;
      for (int i = 0; i < n; ++i) {
        m[cost[i]] = i;
      }
  
      if (m.count(k)) {
        cout << m[k] + 1 << endl;
        continue;
      }
  
      for (int i = 0; i < n; ++i) {
        if (cost[i] == -1) continue;
        const int j = g[i][0];
        if (cost[i] < cost[j]) continue;
        lli z = (k - cost[j]) % (abs(cost[j] - cost[i]) + 1);
        cout << m[cost[j] + z] + 1 << endl;
        break;
      }
    }
  
    return 0;
  }
  