#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
#define LF(x) fixed<<setprecision(x)
const double pi=3.14159265358979323846;
const double eps=1e-9;
const int inf=1e9;
const long long INF=4e18;
const int mod=1e9+7;
using namespace std;
const int N=1e5+10;

void solve()
{
    int n,m;
    cin>>n>>m;
    vector<vector<int>>a(n+1,vector<int>(m+1));
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		cin>>a[i][j];
    	}
    }
    auto bfs=[&](){
    	queue<array<int,2>>q;
    	vector<int>ans;
    	q.push({1,1});
    	while(q.size()){
    		auto [x,y]=q.front();
    		ans.push_back(a[x][y]);
    		q.pop();
    		if(y+1<=m&&x+1<=n){
    			int x1=x+1,y1=y;
    			int x2=x,y2=y+1;
    			if(a[x1][y1]<a[x2][y2]){
    				q.push({x1,y1});
    			}
    			else q.push({x2,y2});
    		}
    		else if(y+1<=m){
    			q.push({x,y+1});
    		}
    		else if(x+1<=n)q.push({x+1,y});
    	}
    	return ans;
    };
    vector<int>ans=bfs();
    sort(all(ans));
    for(int i=0;i<ans.size();i++){
    	if(ans[i]!=i){
    		cout<<i<<endl;
    		return;
    	}
    }
    cout<<ans.size()<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}