#include<bits/stdc++.h>
//#pragma gcc optimize(3)
#define gc getchar()
//char buf[100000],*buff = buf + 100000;
//#define gc ((buff == buf + 100000 ? (fread(buf,1,100000,stdin),buff = buf) : 0),*(buff++))
#define pc putchar
//char bfu[10000000],*bfuu = bfu;
//#define pc(x) (*(bfuu++) = x)
#define li long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define md int mid = l + r >> 1
#define ls q << 1
#define rs q << 1 | 1
#define ln ls,l,mid
#define rn rs,mid + 1,r
using namespace std;
//const int mo = 998244353;
//const int mo = 1000000007;
inline li read(){
	li x = 0;
	int y = 0,c = gc;
	while(c < '0' || c > '9') y = c,c = gc;
	while(c >= '0' && c <= '9') x = x * 10 + c - '0',c = gc;
	return y == '-' ? -x : x;
}
inline void prt(li x){
	if(x >= 10) prt(x / 10);
	pc(x % 10 + '0');
}
inline void print(li x){
	if(x < 0) pc('-'),x = -x;
	prt(x);
}
inline void file(char *s){
	char c[50];
	sprintf(c,"%s.in",s);
	freopen(c,"r",stdin);
	sprintf(c,"%s.out",s);
	freopen(c,"w",stdout);
}
li s1 = 19260817,s2 = 23333333,s3 = 998244853,srd;
inline li rd(){
	return srd = (srd * s1 + s2 + rand()) % s3;
}
int t,n,m,cnt,a[3][4],b[1000010][3],c[1010][1010];
char ch[100010];
int main(){
	srand(time(0));rd();
	//file("");
	t = read();
	int i,j,l,x,y,z;
	while(t--){
		n = read();m = read();cnt = 0;
		memset(a,0,sizeof(a));a[0][0] = a[1][1] = a[2][2] = 1;
		for(i = 0;i < n;++i){
			for(j = 0;j < n;++j){
				b[++cnt][0] = i;b[cnt][1] = j;b[cnt][2] = read() - 1;
			}
		} 
		scanf("%s",ch);
		for(i = 0;i < m;++i){
			if(ch[i] == 'L') --a[1][3];
			else if(ch[i] == 'R') ++a[1][3];
			else if(ch[i] == 'U') --a[0][3];
			else if(ch[i] == 'D') ++a[0][3];
			else if(ch[i] == 'I'){
				swap(a[1][0],a[2][0]);
				swap(a[1][1],a[2][1]);
				swap(a[1][2],a[2][2]);
				swap(a[1][3],a[2][3]);
			}
			else{
				swap(a[0][0],a[2][0]);
				swap(a[0][1],a[2][1]);
				swap(a[0][2],a[2][2]);
				swap(a[0][3],a[2][3]);
			}
		}
		for(i = 1;i <= cnt;++i){
			x = ((a[0][0] * b[i][0] + a[0][1] * b[i][1] + a[0][2] * b[i][2] + a[0][3]) % n + n) % n;
			y = ((a[1][0] * b[i][0] + a[1][1] * b[i][1] + a[1][2] * b[i][2] + a[1][3]) % n + n) % n;
			z = ((a[2][0] * b[i][0] + a[2][1] * b[i][1] + a[2][2] * b[i][2] + a[2][3]) % n + n) % n;
			c[x + 1][y + 1] = z + 1; 
		}
		for(i = 1;i <= n;++i){
			for(j = 1;j <= n;++j){
				print(c[i][j]);pc(' ');
			}
			pc('\n');
		}
	}
	//fwrite(bfu,1,bfuu - bfu,stdout);
	//cerr<<clock();
	return 0;
}