#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;


int main()
{
int a[100][100];
int temp[100][100];
int n,i,j,k;
int m1, m2;
int count=1;
scanf("%d", &n);
while (n--)
{
scanf("%d%d", &m1, &m2);
for (i = 0; i < m1; i++)
{
for (j = 0; j < m2; j++)
{
scanf("%d", &a[i][j]);
}
}
printf("Case #%d:\n", count++);
for (i = 0; i < m2; i++)
{
for (j = 0; j <m1; j++)
{
temp[i][j] = a[m1 - 1 - j][i];
}
}
for (i = 0; i < m2; i++)
{
for (j = 0; j < m1; j++)
{
if (j == m1 - 1)
{
cout << temp[i][j];
}
else
{
cout << temp[i][j] << " ";
}
}
cout << endl;
}


}
    return 0;
}