#include<bits/stdc++.h>
using namespace std;
constexpr int M=1005;char s[M*M];
int n,m,k,x,y,ans,len,u,d,l,r,U,D,L,R,a[M][M];
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
void upd(int x,int y){
	int xl=U-x,xr=D-x,yl=L-y,yr=R-y;
	xl=max(xl,1);xr=min(xr,n);
	yl=max(yl,1);yr=min(yr,m);
	if (xl>xr||yl>yr) return ;
	a[xl][yl]++;a[xl][yr+1]--;a[xr+1][yl]--;a[xr+1][yr+1]++;
}
void solve(){ ans=0;
	n=read();m=read();k=read();
	scanf("%s",s+1);len=strlen(s+1);
	U=u=L=l=1;D=d=n;R=r=m;
	for (int i=1;i<=len;i++){
		if (s[i]=='D') u--,d--;
		else if (s[i]=='U') u++,d++;
		else if (s[i]=='R') l--,r--;
		else if (s[i]=='L') l++,r++;
		U=max(U,u);D=min(D,d);
		L=max(L,l);R=min(R,r);
	}
	if (U>D||L>R) return printf("%d\n",k?0:n*m),void();
	k=(D-U+1)*(R-L+1)-k;
	if (k<0) return puts("0"),void();
	map<pair<int,int>,bool>mp;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			a[i][j]=0;
	x=y=0;upd(0,0);
	for (int i=1;i<=len;i++){
		x+=(s[i]=='U')-(s[i]=='D');
		y+=(s[i]=='L')-(s[i]=='R');
		if (!mp[{x,y}]) mp[{x,y}]=1,upd(x,y);
	}
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			ans+=(a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1])==k;
	printf("%d\n",ans);
}
int main(){int T=read();
	while (T--) solve();	
	return 0;
}