#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define req(i,a,b) for(int i=a;i>=b;--i)
#define rep_(i,a,b) for(int i=a;i<b.size();++i)
#define F(a) for(int a=1;a<=n;++a)
#define M(a,b) memset(a,b,sizeof a)
#define DC int T;cin>>T;while(T--)
#define rd(a) a=read()
#define ll long long
#define Z(a) sort(a+1,a+n+1)
using namespace std;
const unsigned _mod=998244353;
const unsigned mod=1e9+7;
const ll infi=0x3f3f3f3f3f3f3f3fll;
const int inf=0x3f3f3f3f;
ll read(){ll x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}
ll ksm(ll x,ll y){ll ret=1;while(y){if(y&1ll)ret=ret*x%mod;y>>=1ll;x=x*x%mod;}return ret;}
ll qpow(ll x,ll y){ll ret=1;while(y){if(y&1ll) ret=ret*x;y>>=1ll;x=x*x;}return ret;}
ll _gcd(ll x,ll y){return y?_gcd(y,x%y):x;}
/*
    [[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]
    [[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]
    [[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]
*/
int T,n,m,k,a[1010][1010],b[1010][1010],p[3],d[3],c[3];
string s;
inline ll Mod(ll a){return ((a-1)%n+n)%n+1;}
int main()
{
	DC
    {
		cin>>n>>m;
		F(i) F(j) rd(a[i][j]);
        cin>>s;
		p[0]=0,p[1]=1,p[2]=2,d[0]=d[1]=d[2]=0;
		rep(i,0,m-1)
        {
			if (s[i]=='R') d[p[1]]++;
			if (s[i]=='L') d[p[1]]--;
			if (s[i]=='D') d[p[0]]++;
			if (s[i]=='U') d[p[0]]--;
			if (s[i]=='I') swap(p[1],p[2]);
			if (s[i]=='C') swap(p[0],p[2]);
		}
		F(i) F(j)
        {
			c[0]=Mod(i+d[0]),c[1]=Mod(j+d[1]),c[2]=Mod(a[i][j]+d[2]);
			b[c[p[0]]][c[p[1]]]=c[p[2]];
		}
		F(i) F(j) cout<<b[i][j]<<" \n"[j==n];
        puts("");
	}
    return 0;
}