#include "september.h"
#include <bits/stdc++.h>
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <typename T>
bool mnto(T &a, const T &b) {return b < a ? a = b, 1 : 0;}
template <typename T>
bool mxto(T &a, const T &b) {return b > a ? a = b, 1 : 0;}

typedef long long ll;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define pb push_back
#define SZ(x) ((int) x.size())
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> lll;
typedef vector<iii> viii;
typedef vector<lll> vlll;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXN = 100005;

int n, m;
vi p;
vector<vi> s;
vi adj[MAXN];
int badch[MAXN];
bool mark[MAXN];
int msk[MAXN];

int solve(int N, int M, vi F, vector<vi> S) {
    n = N; m = M; p = F; s = S;
    REP (i, 0, n) {
        adj[i].clear();
    }
    REP (i, 1, n) {
        adj[p[i]].pb(i);
    }
    REP (k, 0, m) {
        REP (i, 0, n) {
            badch[i] = SZ(adj[i]);
            mark[i] = 0;
        }
        int bcnt = 0;
        REP (t, 0, n - 1) {
            int i = s[k][t];
            mark[i] = 1;
            bcnt += badch[i];
            badch[p[i]]--;
            if (mark[p[i]]) {
                bcnt--;
            }
            msk[t] |= (bcnt == 0) << k;
        }
    }
    int ans = 0;
    REP (i, 0, n - 1) {
        ans += msk[i] == (1 << m) - 1;
    }
	return ans;
}