#include<iostream>

#include<cstring>

#include<cstdio>

using namespace std;

double a[][],dp[][<<];

int n,m;

int main()

{

    int T;

    scanf("%d",&T);

    for(int x = ;x <= T;x++)

    {

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

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

        {

            for(int j = ;j < (<<n);j++)  dp[i][j] = -;

        }

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

        {

            for(int j = ;j <= m;j++)  scanf("%lf",&a[i][j]);

        }

        dp[][] = ;

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

        {

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

            {

                if(dp[i][j] < )    continue;

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

                {

                    if((j & (<<(k-))) == )

                    {

                        int temp = j | (<<(k-));

                        if(temp == (<<n)-)    temp = ;

                        dp[i+][temp] = max(dp[i+][temp],dp[i][j]+a[k][i+]);

                    }

                }

            }

        }

        double ans = -;

        for(int i = ;i < (<<n);i++)   ans = max(ans,dp[m][i]);

        printf("Case #%d: %.5f\n",x,ans);

    }

    return ;

}