#include "september.h"
#include <iostream>
#include <vector>
#include <cmath>
#include<map>
#include <algorithm>
#include <iomanip>
#include <string>
#include<stack>
#include <set>
#include <queue>
#include <chrono>
#include<array>
#include<bitset>
#include<unordered_map>
#include<random>
#include<cassert>
#include<cstring>
using namespace std;
using ll = long long;
using db = double;
const float pi = 3.14159265359;
#define V vector
#define VI V<int>
#define P pair<int,int>
#define rep(i, a, b, step) for (int i = int(a); i <= int(b); i += step)
#define repl(i,a,b,step) for (int i = int(a); i >= int(b); i -= step)
#define prime(n) [](int x) { for (int i = 2; i *1ll* i <= x; ++i) if (x % i == 0) return false; return x > 1; }(n)
#define printall(container, ch) for (const auto& elem : container) { std::cout << elem << ch; } std::cout << std::endl;
#define sn << '\n'
#define ed << endl
#define sz size()
#define print cout <<
#define debug(x) cerr<< #x << " = " << x sn;
#define mpII map<int,int>
#define mine min_element
#define maxe max_element
#define all(v) begin(v), end(v)
#define txt freopen("snakes.in", "r", stdin); freopen("snakes.out", "w", stdout)
#define MEX(a) [](VI a){set<int>elem;for(auto&i:a)elem.insert(i);int ret=0;while(elem.count(ret))ret++;return ret;}(a)
#define pb push_back
#define pq priority_queue
#define rev reverse
#define nuyn(a) a.erase(unique(all(a)), end(a))
#define nx next_permutation
#define pk pop_back()
#define START print "Start" sn
#define END print "End" sn
#define ff first
#define ss second
#define ts to_string
#define ub upper_bound
#define mk make_pair
#define lb lower_bound
#define testcase int t;cin>>t;while(t--)solution();
const int N = 1e5;
int ind[N], mx[N], mxr;
bool vis[N];
VI graph[N];
void dfs(int u) {
mx[u] = ind[u];
vis[u] = 1;
for (auto& i : graph[u]) {
if (!vis[i])dfs(i);
mx[u] = max(mx[u], mx[i]);
}
mxr = max(mxr, mx[u]);
}
int solve(int n, int m, std::vector<int> f, std::vector<std::vector<int>> s) {
rep(i, 0, n - 1, 1)graph[i].clear(), vis[i] = 0;
rep(i, 0, n - 2, 1)rep(j, 0, m - 1, 1)
ind[s[j][i]] = max(ind[s[j][i]], i);
rep(i, 1, n - 1, 1)graph[f[i]].pb(i);
mxr = -1;
int ans = 0;
rep(i, 0, n - 2, 1) {
if (i > mxr) {
ans++;
mxr++;
}
dfs(s[0][i]);
}
return ans;
}
