#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define MOD 100000

 using namespace std;

 const int maxn = ;

 struct pos {

     int x, y;

 };

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

 int Map[maxn][maxn];

 int vis[maxn][maxn] = {  };

 int r, c, ans;

 bool in(int x, int y, int val)

 {

     if (Map[x][y]<val && !vis[x][y] && x >=  && x <= r&&y >=  && y <= c) return true;

     return false;

 }

 void dfs(int x, int y, int lev, int dep)

 {

     ans = max(ans, dep);

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

         int nowx=x, nowy=y;

         nowx += dir[i].x, nowy += dir[i].y;

         if (in(nowx, nowy, lev)) {

             vis[nowx][nowy] = ;

             int t = dep + ;

             dfs(nowx, nowy, Map[nowx][nowy], t);

             vis[nowx][nowy] = ;

         }

     }

     return;

 }

 int main()

 {

     int N;

     cin >> N;

     char s[];

     while (N--)

     {

         scanf("%s", s);

         scanf("%d%d", &r, &c);

         memset(vis, , sizeof(vis));

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

             for (int j = ; j <= c; j++) {

                 cin >> Map[i][j];

             }

         ans = ;

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

             for (int j = ; j <= c; j++) {

                 vis[i][j] = ;

                 dfs(i, j, Map[i][j], );

                 vis[i][j] = ;

             }

         cout << s << ": " << ans << endl;

     }

     return ;

 }