#include<bits/stdc++.h>
#define taskname ""
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define int ll
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
#define Faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int maxn=2e6+6;
const int INF=1e9;
const int mod=1e9+7;
int m,n,x[maxn],y[maxn];
struct P
{
    int x,y;
}p[maxn];
bool operator <(P a,P b)
{
    if(a.x==b.x) return a.y<b.y;
    return a.x<b.x;
}
bool operator ==(P a,P b)
{
    return a.x==b.x&&a.y==b.y;
}
set<P> s;
void solve()
{
    cin>>n>>m;
    s.clear();
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            int xx;
            cin>>xx;
            p[xx].x=i;
            p[xx].y=j;
        }
    }
    s.insert(p[0]);
    for(int i=1;i<=n*m-1;i++)
    {
        bool can=1;
        auto it=s.lower_bound(p[i]);
        if(it!=s.end()&&it->y<p[i].y) can=0;
        if(it!=s.begin())
        {
            --it;
            if(it->y>p[i].y) can=0;
        }
        if(!can) break;
        s.insert(p[i]);
    }
    cout<<s.size()<<"\n";
}
signed main()
{
    if (fopen(taskname".INP","r"))
    {
        freopen(taskname".INP","r",stdin);
        freopen(taskname".OUT","w",stdout);
    }
    Faster
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }

}