#include <map>

#include <set>

#include <list>

#include <cmath>

#include <queue>

#include <stack>

#include <cstdio>

#include <vector>

#include <string>

#include <cctype>

#include <complex>

#include <cassert>

#include <utility>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

using namespace std;

typedef pair<int,int> PII;

typedef long long ll;

#define lson l,m,rt<<1

#define pi acos(-1.0)

#define rson m+1,r,rt<<11

#define All 1,N,1

#define read freopen("in.txt", "r", stdin)

const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;

const int INF= 0x7ffffff;

const int mod =  ;

int dp[][],mapc[][];

int n,m;

int dir[][]={{,},{,-},{,},{-,}};

int dfs(int x,int y){

    int f=;

    if(dp[x][y]!=-)return dp[x][y];

    int tmp=-;

    for(int i=;i<;++i){

        int xx=x+dir[i][];

        int yy=y+dir[i][];

        if(xx>=&&xx<n&&yy>=&&yy<m&&mapc[xx][yy]<mapc[x][y]){

        tmp=max(tmp,dfs(xx,yy)+);

        f=;

        }

    }

    if(!f)tmp=;

    return dp[x][y]=tmp;

}

int main()

{

    string s;

    int t;

    scanf("%d",&t);

    while(t--){

        cin>>s;

        scanf("%d%d",&n,&m);

        for(int i=;i<n;++i)

        for(int j=;j<m;++j)

        scanf("%d",&mapc[i][j]);

        memset(dp,-,sizeof(dp));

        int maxn=-;

        for(int i=;i<n;++i)

            for(int j=;j<m;++j)

            maxn=max(maxn,dfs(i,j));

        cout<<s<<": ";

        printf("%d\n",maxn);

    }

return ;

}