#include<iostream>
#include<cstring>
#include<cstdio>
#include<climits>
#include<algorithm>
#include<queue>
#include<vector>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
inline int read(){
	int f=1,ans=0; char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
	return f*ans;
}
const int MAXN=1e3+11;
const int MAXM=1e5+11;
int A[MAXN][MAXN],N,M,T,tmp[4],del[4],Ans[MAXN][MAXN],res[4]; char str[MAXM];
int Mod(int x){return ((x%N)+N)%N;}
int main(){
	//freopen("3.in","r",stdin);
	T=read();
	while(T--){
		N=read(),M=read(); for(int i=0;i<N;i++) for(int j=0;j<N;j++) A[i][j]=read()-1;
		scanf("%s",str+1); for(int i=1;i<=3;i++) tmp[i]=i,del[i]=0;
		for(int i=1;i<=M;i++){
			if(str[i]=='R') del[tmp[2]]++;
			if(str[i]=='L') del[tmp[2]]--;
			if(str[i]=='D') del[tmp[1]]++;
			if(str[i]=='U') del[tmp[1]]--;
			if(str[i]=='I') swap(tmp[2],tmp[3]);
			if(str[i]=='C') swap(tmp[1],tmp[3]);
		}
		//for(int i=1;i<=3;i++) printf("%d %d\n",tmp[i],del[i]);
		for(int i=0;i<N;i++){
			for(int j=0;j<N;j++){
				for(int k=1;k<=3;k++){
					if(tmp[k]==1) res[k]=Mod(del[1]+i);
					if(tmp[k]==2) res[k]=Mod(del[2]+j);
					if(tmp[k]==3) res[k]=Mod(del[3]+A[i][j]);
				}
				//cerr<<res[1]<<" "<<res[2]<<" "<<res[3]<<" i:"<<i<<" j:"<<j<<endl;
				Ans[res[1]][res[2]]=res[3];
			}
		}
		for(int i=0;i<N;i++){
			for(int j=0;j<N;j++) printf("%d ",Ans[i][j]?Ans[i][j]+1:1);printf("\n");
		}
		//return 0;
	}return 0;
}