#include<cstdio>

#include<cstring>

#include<vector>

using namespace std;

const int maxn = ;

int g[maxn+][maxn];

int d[maxn+][maxn];

int pa[maxn+][maxn];

int m,n;

const int INF = 1e9;

void init(){

    memset(*pa,-,sizeof(*pa));

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

        d[i][] = INF;

}

vector<int> ans;

void print_ans(int s){

    ans.clear();

    ans.push_back(s);

    for(int i = m-; i > ; i--){

        s = pa[i][s];

        ans.push_back(s);

    }

    for(int i = ans.size()-; i >  ;i--){

        printf("%d ",ans[i]);

    }

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

}

void work()

{

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

        d[][i] = g[][i];

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

        d[i][n+] = INF;

    }

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

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

            int Min = -;

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

                if(d[i-][j+k] <= d[i-][j+Min]){

                    Min = k;

                }

            }

            pa[i][j] = j+Min;

            d[i][j] = d[i-][j+Min] + g[i][j];

        }

    }

    int Min = ;

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

        if(d[m-][Min] >= d[m-][i]){

            Min = i;

        }

    }

    print_ans(Min);

}

int main()

{

    int T;

    init();

    scanf("%d",&T);

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

        printf("Case %d\n",i);

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

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

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

                scanf("%d",g[i]+j);

        work();

    }

    return ;

}