#include <bits/stdc++.h>
using namespace std;
#include "september.h"
#define MAXN 100005
#define MAXM 6
int dep[MAXN];
vector<int> edge[MAXN];
int F[MAXN],S[MAXM][MAXN];
int sum[MAXM][MAXN];//xia mian you ji ge dian zai xu lie li
int status[MAXM][MAXN];//mu qian zhuang kuang
bool ok[MAXM][MAXN];
int nowin[MAXM][MAXN];
void dfs1(int now){//calcu dep
    dep[now] = 1;
    for(int i = 0; i < edge[now].size(); i++){
        if(edge[now][i] == F[now]) continue;
        dfs1(edge[now][i]);
        dep[now] += dep[edge[now][i]];
    }
}
int solve(int n,int m,vector<int> f,vector< vector<int> > s){
    for(int i = 1; i < n; i++) F[i] = f[i-1];
    for(int i = 0; i < m; i++){
        for(int j = 0; j < n; j++) S[i][j] = s[i][j];
    }
    memset(dep,0,sizeof(dep));
    memset(sum,0,sizeof(sum));
    memset(status,0,sizeof(status));
    memset(ok,0,sizeof(ok));
    memset(nowin,0,sizeof(nowin));
    for(int i = 0; i < n; i++) edge[i].clear();
    for(int i = 1; i < n; i++){
        edge[i].push_back(F[i]);
        edge[F[i]].push_back(i); 
    }
	dfs1(0);
    //for(int i = 1; i < n; i++) cout << dep[i] << " ";
    for(int i = 0; i < n-1; i++){//mei ju di i tian
        for(int j = 0; j < m; j++){
            int dian = S[j][i];
            while(1){
            	if(dian == 0) break;
                if(status[j][dian] == 0 && dian == S[j][i]) status[j][dian] = -1,status[j][n]--,sum[j][dian]++;
                if(sum[j][dian] == dep[dian]){
                    status[j][n] += (1 - status[j][dian]);
                    status[j][dian] = 1;
                    sum[j][F[dian]] += sum[j][dian];
                    dian = F[dian];
                }else break;
            }
            if(status[j][n] == i+1) ok[j][i] = 1;
            else ok[j][i] = 0;
        }
    }
    int ans = 0;
    for(int i = 0; i < n-1; i++){
        for(int j = 0; j < m; j++){
            //cout << status[j][i] << " " << ok[j][i] << endl;
            nowin[j][S[j][i]] = 1;
        }
        bool ok1 = 1;
        for(int j = 0; j < m; j++){
            int count = 0;
            for(int jj = 0; jj < m; jj++) count += nowin[jj][S[j][i]];
            if(count != m){
                ok1 = 0; break;
            }
        }
        if(ok1 == 0) continue;
        int count = 0;
        for(int j = 0; j < m; j++) if(ok[j][i] == 1) count++;
        if(count == m) ans++; 
    }
    return ans;
}