#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n';
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n';
using namespace std;
typedef long long ll;
typedef double ld;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pil>vpil;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=1010;
int n,m,k,len;
char s[N*N];
int tg=N/2*3;
int f[N*3][N*3];
int o(int x,int y){
	return f[x+tg][y+tg];
}
void st(int x,int y,int z){
	f[x+tg][y+tg]=z;
}
void solve(){
	read(n,m,k);
	scanf("%s",s+1);len=strlen(s+1);
	int xl=1,xr=n,yl=1,yr=m;
	int dx=0,dy=0;
	for(int i=1;i<=len;i++){
		if(s[i]=='L')--dy;
		if(s[i]=='R')++dy;
		if(s[i]=='U')--dx;
		if(s[i]=='D')++dx;
		if(dx>0)cmin(xr,n-dx);
		if(dy>0)cmin(yr,m-dy);
		if(dx<0)cmax(xl,-dx+1);
		if(dy<0)cmax(yl,-dy+1);
	}
	if(xl>xr||yl>yr){
		if(k==0)cout << n*m << '\n';
		else puts("0");
		return ;
	}
	for(int i=-n-10;i<=n+10;i++)
		for(int j=-m-10;j<=m+10;j++)
			st(i,j,0);
	dx=dy=0;
	st(dx,dy,1);
	for(int i=1;i<=len;i++){
		if(s[i]=='L')++dy;
		if(s[i]=='R')--dy;
		if(s[i]=='U')++dx;
		if(s[i]=='D')--dx;
		st(dx,dy,1);
//		dpi(dx,dy);
	}
	for(int i=-n-9;i<=n+9;i++)
		for(int j=-m-9;j<=m+9;j++)
			f[i+tg][j+tg]=o(i,j)+o(i-1,j)+o(i,j-1)-o(i-1,j-1);
	int ans=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			int ct=o(xr-i,yr-j)-o(xl-i-1,yr-j)-o(xr-i,yl-j-1)+o(xl-i-1,yl-j-1);
			if((xr-xl+1)*(yr-yl+1)-ct==k){
				++ans;
//				dpi(i,j);
			}
		}
	cout << ans << '\n';
}
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	int T;
	read(T);
	while(T--)solve();
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}