#include<bits/stdc++.h>
#define ll long long
#define int ll
const int N=1e5+10;
using namespace std;
vector<int>f;
void dfs(vector<vector<int>>a,int n,int m,int i,int j)
{
    f.push_back(a[i][j]);
    if(i==n&&j==m)
        return;
    if(i+1<=n)
    {
        if(j+1<=m)
        {
            if(a[i+1][j]<a[i][j+1])
                dfs(a,n,m,i+1,j);
            else
                dfs(a,n,m,i,j+1);
        }
    }else
        dfs(a,n,m,i,j+1);
}
void solve()
{
   int n,m;
   cin>>n>>m;
   vector<vector<int>>a(n+1,vector<int>(m+1,0));

   for(int i=1;i<=n;i++)
   {
       for(int j=1;j<=m;j++)
       {
           cin>>a[i][j];
       }
   }
   f.clear();
  dfs(a,n,m,1,1);
  sort(f.begin(),f.end());
   for(int i=0;i<f.size();i++)
   {
       if(f[i]!=i)
       {
           cout<<i<<"\n";
           return;
       }
   }
   cout<<f.size()<<"\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
}