#include <bits/stdc++.h>

using namespace std;

int solve(int n, int m, vector<int> fa, vector< vector<int> > p) {
    vector< vector<int> > G(n);
    for (int i = 1; i < n; ++i) G[i].push_back(fa[i]), G[fa[i]].push_back(i);
    unordered_map<int, int> M;
    map< pair<int, int>, int> E;
    int res = 1;
    for (int i = 0; i < n - 1; ++i) {
        for (int j = 0; j < m; ++j) {
            ++M[p[j][i]];
            for (auto v : G[p[j][i]]) E[make_pair(min(p[j][i], v), max(p[j][i], v))] = 1;
        }
        res += (M.size() == i + 1 && M.size() - 1 == E.size());
    }
    return res;
}