#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define ldb long double
#define pii pair<int,int>
#define mkp make_pair
#define mkt make_tuple
#define fr first
#define se second
#define uset unordered_set
#define umap unordered_map
#define pqueue priority_queue
#define all(_box) _box.begin(),_box.end()
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define clz __builtin_clz
#define lbd lower_bound
#define ubd upper_bound
#define deb(x) cerr<<#x<<'='<<(x)<<' '
using namespace std;
const int N=104;
int n,m;
int a[N][8];

int solve(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=0;j<m;j++)cin>>a[i][j];
    vector<int>p(m);
    iota(all(p),0);
    int ans=0;
    do{
        int res=0;
        for(int i=1;i<=n;i++){
            int mx=0,sum=0;
            for(int j=0;j<m;j++)
                mx=max(mx,sum+=a[i][p[j]]);
            res+=mx;
        }
        ans=max(ans,res);
    }while(next_permutation(all(p)));
    return ans;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    int T;
    cin>>T;
    for(int i=1;i<=T;i++){
        printf("Case #%d: %d\n",i,solve());
    }
}