#include<bits/stdc++.h>
#define ll long long
#define re register
#define il inline
#define N 1003
#define maxN 2050
#define Ls 1000006
using namespace std;
int n,m,k,a[maxN][maxN];
char s[Ls];
int main()
{
	int T;cin>>T;
	while(T--) {
		cin>>n>>m>>k>>s;
		int nu=1,nd=n,nl=1,nr=m;
		int mu=1,md=n,ml=1,mr=m;
		int x=N,y=N,ls=strlen(s);
		int B_x=N-n-3,E_x=N+n+3,B_y=N-m-3,E_y=N+m+3;a[x][y]=1;
		for(int i=0;i<ls;i++) {
			if(s[i]=='U') nu++,nd++,x++;
			else if(s[i]=='D') nu--,nd--,x--;
			else if(s[i]=='L') nl++,nr++,y++;
			else nl--,nr--,y--;
			mu=mu<nu?nu:mu;md=md>nd?nd:md;	
			ml=ml<nl?nl:ml;mr=mr>nr?nr:mr;
			if(B_x<=x&&x<E_x&&B_y<=y&&y<E_y) a[x][y]=1;
		}
		if(mu>md||ml>mr) {
			if(k==0) cout<<(n*m)<<endl;
			else cout<<0<<endl; continue;
		}
		int ns=(mr-ml+1)*(md-mu+1),ans=0;
		if(ns<k) {cout<<0<<endl; continue;}
		for(int i=B_x;i<=E_x;i++)
			for(int j=B_y;j<=E_y;j++)
				a[i][j]+=a[i][j-1]+a[i-1][j]-a[i-1][j-1];
		for(int i=N-n;i<N;i++)
			for(int j=N-m;j<N;j++) {
				//有交集
				int x=i+mu,xx=i+md,y=j+ml,yy=j+mr;
				int ss=a[xx][yy]-a[x-1][yy]-a[xx][y-1]+a[x-1][y-1];
				if(ns-ss==k) ans++;
			}
		cout<<ans<<endl;
		for(int i=B_x;i<=E_x;i++)
			for(int j=B_y;j<=E_y;j++)
				a[i][j]=0;
		
	}

	return 0;
}