// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
//#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 400005
#define inf 0x3f3f3f3f

int n,m,p[10],a[maxn][10];
void work(int ID)
{
	n=read(),m=read();
	For(i,1,m)p[i]=i;
	For(i,1,n)For(j,1,m)a[i][j]=read();
	int res=0;
	do{
		int qwq=0;
		For(i,1,n){
			int mx=0,now=0;
			For(j,1,m) now+=a[i][p[j]],mx=max(mx,now);
			qwq+=mx;
		}
		res=max(res,qwq);
	}while(next_permutation(p+1,p+m+1));
	cout<<"Case #"<<ID<<": "<<res<<"\n";
}

signed main()
{
	int T=read();
	For(_,1,T)work(_);
	return 0;
}
/*
3
0 1 2
1 2 3
1 2 1

2 0
4
1 1 2 3
1 2 3 3
7
1 1 1 1 2 3 4
1 2 3 4 4 4 4
*/