#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
int main()
{
	int t;
	int n, m, k;
	int map[100][100], aa[100][100];
	int q;
	cin >> t;
	while (t--) 
	{
		cin >> n >> m >> k;
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++)
			{
				scanf("%d", &map[i][j]);
			}
		}
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++)
			{
				aa[i][j] = map[i][j];
			}
		}
		for (int l = 0; l < k; l++) 
		{
			for (int i = 0; i < n; i++)
			{
				for (int j = 0; j < m; j++)
				{
					aa[j][n - i - 1] = map[i][j];
				}
			}
			q = m;m = n;n = q;
			for (int i = 0; i < n; i++)
			{
				for (int j = 0; j < m; j++)
				{
					map[i][j] = aa[i][j];
				}
			}
		}
		for (int i = 0; i < n; i++) 
		{
			printf("%d", aa[i][0]);
			for (int j = 1; j < m; j++)
			{
				printf(" %d", aa[i][j]);
			}
			cout << endl;
		}
		cout << endl;
	}
	return 0;
}