#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 2e5+9;const ll MOD = 1e9 + 7;
vector<vector<ll>> a,dp;
set<ll> ans;
void solve(){
    ll n,m;cin>>n>>m;
    a.resize(n+10);
    dp.resize(n+10);
    for (ll i = 0; i <= n; i++)
    {
        a[i].resize(m+10);
        dp[i].resize(m+10);
    }
    
    for (ll i = 1; i <= n; i++)
    {
        for (ll j = 1; j <= m; j++)
        {
            cin>>a[i][j];
        }
    }
    for (ll i = 1; i <= m; i++)
    {
        dp[1][i]=1;
    }
    for (ll i = 1; i <= n; i++)
    {
        dp[i][1]=2;
    }
    for (ll i = 2; i <= n; i++)
    {
        for (ll j = 2; j <= m; j++)
        {
            if(a[i-1][j]<a[i][j-1]) dp[i][j]=2;
            else dp[i][j]=1;
        }

    }
    ans.clear();
    ll x=n,y=m;
    while(x!=1 or y!=1){
        ans.insert(a[x][y]);
        if(dp[x][y]==1) y--;
        else x--;
    }
    ans.insert(a[x][y]);
    auto it=ans.begin();
    ll now=0;
    while(*it==now and it!=ans.end()){
        now++;it++;
    }
    
    cout<<now<<"\n";

}
int main(){
    ios;ll _=1;cin>>_;
    while (_--)solve();
    return 0;
}