#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int m, vector<int> F, vector<vector<int> > S) {
int ans = 1;
vector<int> dp(n, -1);
vector<vector<int> > in(m, vector<int>(n));
vector<int> NOW(m);
vector<vector<int> > VIS(m, vector<int> (n));
for(int j = 0; j < m; j++) for(int i = 1; i < n; i++) in[j][F[i]]++;
dp[0] = 0;
for(int o = 0; o < n-1; o++) {
vector<int> ok(n, 1);
int OK = 1;
for(int l = 0; l < m; l++) {
OK &= (NOW[l] == 0);
int j = S[l][o];
VIS[l][j] = 1;
if(in[l][j] > 0) NOW[l]++;
in[l][F[j]]--;
if(VIS[l][F[j]] && in[l][j] == 0) NOW[l]--;
}
for(int l = 0; l < m; l++) {
if(OK) {
vector<int> vis(n);
auto tmp_in = in[l];
int now = 0;
for(int k = o; k < n-1; k++) {
int i = S[l][k];
vis[i] = 1;
if(tmp_in[i] > 0) now++;
tmp_in[F[i]]--;
if(vis[F[i]] && tmp_in[F[i]] == 0) now--;
if(now != 0) ok[k] = 0;
}
}
}
if(OK) {
for(int k = o; k < n-1; k++) if(ok[k]) {
dp[k+1] = max(dp[k+1], dp[o-1+1] + 1);
}
}
}
return dp[n-1];
}
/*
1
5 1
0 1 2 3
4 3 2 1
*/
