/*
(( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) ((
)) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( ))
(( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) ((
)) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( ))
(( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) ((
)) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( ))
(( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) ((
)) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( ))
(( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) (( (( )) )) ((
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (signed i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (signed i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (signed i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;
template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
const int maxN = 505;
int n, t[maxN][maxN], h[maxN][maxN];
vii p;
ll k;
int main() {
#ifdef LOCAL
freopen("input.INP", "r", stdin);
#endif // LOCAL
cin.tie(0) -> sync_with_stdio(0);
cout.tie(0);
cin >> n >> k;
fort(x, 1, n)
fort(y, 1, n) {
cin >> t[x][y];
h[x][y] = -1;
}
p.emplace_back(1, 2);
h[1][2] = 0;
--k;
for (int i = 1, x, y; k > 0; ++i, --k) {
x = p.back().se;
y = t[x][p.back().fi];
if (h[x][y] >= 0) {
cout << p[h[x][y] + (k - 1) % (i - h[x][y])].fi << '\n';
return 0;
}
p.emplace_back(x, y);
h[x][y] = i;
}
cout << p.back().fi << '\n';
return 0;
}
