#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
inline int read(){
	int x=0,k=1;char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')k=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*k;
}
string s;
int a[1005][1005];
struct node{
	int a,b,c,d;
	friend bool operator <(node x,node y){
		if(x.a==y.a){
			if(x.b==y.b){
				if(x.c==y.c)return x.d<y.d;
				return x.c<y.c;
			}
			return x.b<y.b;
		}
		return x.a<y.a;
	}
};
void sol(){
	int n=read(),m=read(),k=read();
	int x1=1,y1=1,x2=n,y2=m;
	cin>>s;
	for(char c:s){
		if(c=='U')x1=max(x1-1,1ll),--x2;
		else if(c=='D')x2=min(x2+1,n),++x1;
		else if(c=='L')y1=max(y1-1,1ll),--y2;
		else y2=min(y2+1,m),++y1;
	}
	int sum=0;
	if(x2>=x1&&y2>=y1)sum=(x2-x1+1)*(y2-y1+1);
	if(sum<k){
		puts("0");
		return;
	}
	if(sum==0){
		cout<<n*m<<endl;
		return;
	}
	for(int i=0;i<=n+1;++i)
		for(int j=0;j<=m+1;++j)a[i][j]=0;
	++a[x1][y1],++a[x2+1][y2+1],--a[x1][y2+1],--a[x2+1][y1];
	set<node>se;
	se.insert({x1,y1,x2,y2});
	for(int i=s.length()-1;~i;--i){
		char c=s[i];
		if(c=='U')++x1,++x2;
		else if(c=='D')--x1,--x2;
		else if(c=='L')++y1,++y2;
		else --y1,--y2;
		if(se.count({x1,y1,x2,y2}))continue;
		se.insert({x1,y1,x2,y2});
		++a[x1][y1],++a[x2+1][y2+1],--a[x1][y2+1],--a[x2+1][y1];
	}
	int ans=0;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j){
			a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
			if(a[i][j]==sum-k)++ans;
		}
	cout<<ans<<endl; 
}
signed main(){
	int T=read();
	while(T--)sol();
}