#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int o=4100,MOD=998244353;
inline int fix(int x){return x+(x>>31&MOD);}
inline int qp(int b,int f){int res=1;for(;f;f>>=1,b=b*1ll*b%MOD) if(f&1) res=res*1ll*b%MOD;return res;}
int T,n,m,K,f[o][o],g[o][o],w[o],bt1,bt2,rev[o],len,ans,s,lx,rx,ly,ry;char opt[o];
inline void init(){
	int bt=12;
	w[1<<(bt-1)]=1;
	for(int i=(1<<(bt-1))+1,j=qp(3,(MOD-1)/(1<<bt));i<(1<<bt);++i) w[i]=w[i-1]*1ll*j%MOD;
	for(int i=(1<<(bt-1));--i;) w[i]=w[i<<1];
}
inline void ntt(int*a,int n,bool inv){
	for(int i=1;i<n;++i) if(rev[i]<i) swap(a[i],a[rev[i]]);
	for(int md=1;md<n;md<<=1) for(int i=0;i<n;i+=md<<1) for(int j=0,x,y;j<md;++j)
		x=a[i+j],y=a[i+j+md]*1ll*w[j+md]%MOD,a[i+j]=fix(x+y-MOD),a[i+j+md]=fix(x-y);
	if(inv) for(int i=1,j=n-1;i<j;swap(a[i++],a[j--]));
}
inline void foo(bool inv){
	for(int i=1;i<(1<<bt2);++i) rev[i]=(rev[i>>1]>>1)|((i&1)<<(bt2-1));
	for(int i=0;i<(1<<bt1);++i){
		ntt(f[i],1<<bt2,inv);
		if(inv) for(int j=0,coef=qp(1<<bt2,MOD-2);j<(1<<bt2);++j) f[i][j]=f[i][j]*1ll*coef%MOD;
		else ntt(g[i],1<<bt2,inv);
	}
}
inline void bar(bool inv){
	foo(inv);
	for(int i=0;i<(1<<bt1);++i) for(int j=i+1;j<(1<<bt2);++j) swap(f[i][j],f[j][i]),swap(g[i][j],g[j][i]);
	swap(bt1,bt2);foo(inv);
}
inline void mult(){
	if((1<<bt1)*(1<<bt2)<=32){
		for(int i=n*2;i>n;--i) for(int j=m*2;j>m;--j)
			for(int k=1;k<=n;++k) for(int $=1;$<=m;++$) f[i][j]+=f[k][$]*g[i-k][j-$];
		return;
	}
	bar(0);
	for(int i=0;i<(1<<bt1);++i) for(int j=0;j<(1<<bt2);++j) f[i][j]=f[i][j]*1ll*g[i][j]%MOD;
	bar(1);
}
int main(){
	init();
	for(scanf("%d",&T);T--;printf("%d\n",ans),ans=s=lx=rx=ly=ry=0){
		scanf("%d%d%d%s",&n,&m,&K,opt+1);len=strlen(opt+1);
		for(bt1=1;(1<<bt1)<=n*3;++bt1);
		for(bt2=1;(1<<bt2)<=m*3;++bt2);
		for(int i=0;i<(1<<bt1);++i) for(int j=0;j<(1<<bt2);++j) f[i][j]=g[i][j]=0;
		for(int x=0,y=0,i=1;i<=len;++i){
			if(opt[i]=='U') --x;
			else if(opt[i]=='D') ++x;
			else if(opt[i]=='L') --y;
			else ++y;
			lx=min(lx,x);rx=max(rx,x);ly=min(ly,y);ry=max(ry,y);
			if(x>=-n&&x<=n&&y>=-n&&y<=n) g[x+n][y+m]=1;
		}
		for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) if(i+rx<=n&&i+lx>=1&&j+rx<=m&&j+lx>=1) f[i][j]=1,++s;
		if(s<K) continue;
		g[n][m]=1;mult();
		for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) ans+=(f[i+n][j+m]+K==s);
	}
	return 0;
}