#include<bits/stdc++.h>
#define raed read
using namespace std;
const int MAXN = 1010,INF = 0x3f3f3f3f,mod = 1e9+7;
const double eps = 0.0001;
inline int read(){
	int X=0; bool flag=1; char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') flag=0; ch=getchar();}
	while(ch>='0'&&ch<='9') {X=(X<<1)+(X<<3)+ch-'0'; ch=getchar();}
	if(flag) return X;return ~(X-1);
}
int n,m,k,T,a[MAXN][MAXN];
int sum[MAXN][MAXN];
void Modify(int x1,int y1,int x2,int y2,int v){
	sum[x1][y1]+=v;
	sum[x2+1][y1]-=v;
	sum[x1][y2+1]-=v;
	sum[x2+1][y2+1]+=v;
}
unsigned long long M(int a,int b,int c,int d){
	unsigned long long now = 0;
	now = now*13331+a;
	now = now*13331+b;
	now = now*13331+c;
	now = now*13331+d;
}
string s;
signed main(){
	T = read();
	while(T--){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				sum[i][j] = 0;
			}
		}
		cin>>n>>m>>k;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				a[i][j] = 1;
			}
		} 
		cin>>s;
		int MAXx = 0,MAXy = 0,MINx = 0,MINy = 0,nowx = 0,nowy = 0;
		int Stx = 0,Sty = 0,Edx = 0,Edy = 0;
		for(int i=0;i<s.length();i++){
			if(s[i]=='L') nowy--;
			if(s[i]=='R') nowy++;
			if(s[i]=='U') nowx--;
			if(s[i]=='D') nowx++;
			MAXx = max(MAXx,nowx);
			MINx = min(MINx,nowx);
			MAXy = max(MAXy,nowy);
			MINy = min(MINy,nowy);
		}
		int cnt = n*m;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(i+MAXx>n||i+MINx<1||j+MAXy>m||j+MINy<1) a[i][j] = 0,cnt--;
			}
		}
		if(cnt<k){
			cout<<0<<endl;
			continue;
		}
		k = cnt-k;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(a[i][j]){
					if(!Stx) Stx = i,Sty = j;
					Edx = i,Edy = j;
				}
			}
		}
		if(Stx){
			map<int,unsigned long long> mp;
			mp[M(Stx,Sty,Edx,Edy)] = 1;
			Modify(Stx,Sty,Edx,Edy,1);
			for(int i=0;i<s.length();i++){
				if(s[i]=='L'){
					Sty--;
					Edy--;
					if(mp[M(Stx,Sty,Edx,Edy)]) continue;
					mp[M(Stx,Sty,Edx,Edy)] = 1;
					Modify(Stx,Sty,Edx,Edy,1);
				}
				if(s[i]=='R'){
					Sty++;
					Edy++;
					if(mp[M(Stx,Sty,Edx,Edy)]) continue;
					mp[M(Stx,Sty,Edx,Edy)] = 1;
					Modify(Stx,Sty,Edx,Edy,1);
				}
				if(s[i]=='U'){
					Stx--;
					Edx--;
					if(mp[M(Stx,Sty,Edx,Edy)]) continue;
					mp[M(Stx,Sty,Edx,Edy)] = 1;
					Modify(Stx,Sty,Edx,Edy,1);
				}
				if(s[i]=='D'){
					Stx++;
					Edx++;
					if(mp[M(Stx,Sty,Edx,Edy)]) continue;
					mp[M(Stx,Sty,Edx,Edy)] = 1;
					Modify(Stx,Sty,Edx,Edy,1);
				}
			}
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				sum[i][j] = sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+sum[i][j];
			}
		}
		int ans = 0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(sum[i][j]==k) ans++;
			}
		}
		/*for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				cout<<sum[i][j]<<" ";
			}
			cout<<endl;
		}*/
		cout<<ans<<endl;
	}
}
/*
1
3 18 33
UDRLR
*/