#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define enl printf("\n")
#define ni(n) scanf("%d", &(n))
#define pri(n) printf("%d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int MAXN = 5e2 + 5;
const int INF = 1e9 + 7;
int ans[MAXN], mx[MAXN][MAXN][2];
int dp[MAXN][MAXN][2], dp2[MAXN][MAXN][2];
int adj[MAXN][MAXN];
vi nex[MAXN];
int n;
inline int pr(int& x)
{
if (--x < 1) x += n;
}
inline int nx(int& x)
{
if (++x > n) x -= n;
}
inline int norm(int x)
{
if (x < 1) return x + n;
if (x > n) return x - n;
return x;
}
int solve(int l, int r, int k) // path ends at r, interval at l
{
if (dp[l][r][k] != -1) return dp[l][r][k];
int ret = 0;
if (k) { // ccw
for (int i: nex[r])
if ((r < i && i < (l > r ? l : n + 1)) || (i < l && (r < l ? r : 0) < i))
ret = max(ret, max(solve(r, i, 0), solve(l, i, 1)) + 1);
//for (int i = norm(r + 1); i != l; nx(i))
//if (adj[r][i])
//ret = max(ret, max(solve(r, i, 0), solve(l, i, 1)) + 1);
} else { // cw
for (int i: nex[r])
if ((l < i && i < (l < r ? r : n + 1)) || (i < r && (r > l ? l : 0) < i))
ret = max(ret, max(solve(r, i, 1), solve(l, i, 0)) + 1);
//for (int i = norm(l + 1); i != r; nx(i))
//if (adj[r][i])
//ret = max(ret, max(solve(r, i, 1), solve(l, i, 0)) + 1);
}
return dp[l][r][k] = ret;
}
int f2(int l, int r, int k)
{
if (l == r)
return 0;
if (dp2[l][r][k] != -1)
return dp2[l][r][k];
int ret = adj[l][r] ? 0 : -INF;
if (k) {
for (int i: nex[l])
if ((r < i && i < (l > r ? l : n + 1)) || (i < l && (r < l ? r : 0) < i))
ret = max(ret, f2(i, r, 1));
//for (int i = norm(r + 1); i != l; nx(i))
//if (adj[l][i])
//ret = max(ret, f2(i, r, 1));
} else {
for (int i: nex[l])
if ((l < i && i < (l < r ? r : n + 1)) || (i < r && (r > l ? l : 0) < i))
ret = max(ret, f2(i, r, 0));
//for (int i = norm(l + 1); i != r; nx(i))
//if (adj[l][i])
//ret = max(ret, f2(i, r, 0));
}
return dp2[l][r][k] = ret + 1;
}
int main()
{
//clock_t t = clock();
//for (int i = 0; i < MAXN; i++)
//for (int j = 0; j < MAXN; j++)
//dp[i][j][0] = dp[i][j][1] = -1, dp2[i][j][0] = dp2[i][j][1] = -1;
memset(dp, -1, sizeof dp);
memset(dp2, -1, sizeof dp2);
int k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
{
for (;;)
{
int x;
ni(x);
if (x == 0)
break;
adj[i][x] = 1;
nex[i].pb(x);
}
}
for (int i = 1; i <= n; i++)
for (int j: adj[i])
//if (adj[i][j])
ans[i] = max(ans[i], max(solve(i, j, 0), solve(i, j, 1)) + 1);
if (k == 1) for (int i = 1; i <= n; i++)
{
memset(mx, 0, sizeof mx);
for (int x = norm(i + 1); x != i; nx(x))
for (int y = norm(x + 2); y != i; nx(y))
if (adj[i][norm(y - 1)])
mx[x][y][0] = max(solve(x, norm(y - 1), 0) + 1, mx[x][norm(y - 1)][0]);
else
mx[x][y][0] = max(0, mx[x][norm(y - 1)][0]);
for (int x = norm(i - 1); x != i; pr(x))
for (int y = norm(x - 2); y != i; pr(y))
if (adj[i][norm(y + 1)])
mx[y][x][1] = max(solve(x, norm(y + 1), 1) + 1, mx[norm(y + 1)][x][1]);
else
mx[y][x][1] = max(0, mx[norm(y + 1)][x][1]);
for (int l = norm(i + 1); l != norm(i - 2); nx(l))
for (int j = norm(l + 2); j != i; nx(j))
{
if (adj[l][j])
ans[l] = max(ans[l], max(f2(j, i, 0) + mx[l][j][0], f2(j, i, 0) + mx[l][j][1]) + 1);
if (adj[j][l])
ans[j] = max(ans[j], max(f2(l, i, 1) + mx[l][j][0], f2(l, i, 1) + mx[l][j][1]) + 1);
}
}
int ind = 0;
for (int i = 1; i <= n; i++)
if (ans[ind] < ans[i])
ind = i;
printf("%d\n%d\n", ans[ind], ind);
//cout<<clock()-t<<"\n";
return 0;
}
