#include <iostream>

 #include <algorithm>

 #include <cstring>

 #include <cstdio>

 #include <queue>

 #define ll long long

 using namespace std;

 const int N = 1e5+;

 int dp[*][][];

 int maze[][];

 int dfs(int sum,int a,int b)

 {

     if(dp[sum][a][b] != -)

         return dp[sum][a][b];

     if(sum ==  && a ==  && b == )

         return dp[sum][a][b] = maze[][];

     dp[sum][a][b] = ;

     if(a == b)

     {

         if(sum -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a,b) + maze[a][sum-a]);

         if(sum -  >=  && a -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a-,b)+ maze[a][sum-a]);

         if(sum -  >=  && b -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a,b-) + maze[a][sum-a]);

         if(sum -  >=  && a -  >=  && b -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a-,b-) + maze[a][sum-a]);

     }

     else

     {

         if(sum -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a,b) + maze[a][sum-a]+maze[b][sum-b]);

         if(sum -  >=  && a -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a-,b)+ maze[a][sum-a]+maze[b][sum-b]);

         if(sum -  >=  && b -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a,b-) + maze[a][sum-a]+maze[b][sum-b]);

         if(sum -  >=  && a -  >=  && b -  >= )

         dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-,a-,b-) + maze[a][sum-a]+maze[b][sum-b]);

     }

     return dp[sum][a][b];

 }

 void solve()

 {

     int m,n;

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

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

     memset(maze,,sizeof(maze));

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

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

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

     int ans = dfs(n+m-,m-,m-);

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

 }

 int main(void)

 {

     int t,cnt = ;

     scanf("%d",&t);

     while(t--)

     {

         printf("Case %d: ",++cnt);

         solve();

     }

     return ;

 }