#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,k;
ll t;
ll cha[1002][1002];
ll st[1002][1002];
void solve()
{
	cin>>n>>m>>k;
	memset(cha,0,sizeof cha);
	memset(st,0,sizeof st);
	string str;
	cin>>str;
	ll chui=0,shui=0;
	ll p1=0,p2=0,p3=0,p4=0;
	for(auto x:str)
	{
		if(x=='U')
			chui++;
		else if(x=='D')
			chui--;
		else if(x=='L')
			shui++;
		else 
			shui--;
		if(chui>0)
			p1=max(p1,chui);
		else if(chui<0)
			p2=max(p2,(-chui));
	    if(shui>0)
			p3=max(p3,shui);
		else if(shui<0)
			p4=max(p4,(-shui));
		
	}
	p1=1+p1;p2=n-p2;p3=1+p3;p4=m-p4;
	ll len1=p2-p1+1;
	ll len2=p4-p3+1;
	ll x=p1,y=p3;
//	cout<<x<<" "<<y<<endl;
//	cout<<len1<<" "<<len2<<endl;
	if(len1<=0||len2<=0)
	{
		if(k==0)
			cout<<n*m<<endl;
		else cout<<0<<endl;
		return ;
	}
	cha[x][y]++;
	cha[x+len1][y]--;
	cha[x][y+len2]--;
	cha[x+len1][y+len2]++;
	for(auto s:str)
	{
		if(s=='U')
			x--;
		else if(s=='D')
			x++;
		else if(s=='L')
			y--;
		else 
			y++;
		if(st[x][y])continue;
		st[x][y]=1;
		cha[x][y]++;
		cha[x+len1][y]--;
		cha[x][y+len2]--;
		cha[x+len1][y+len2]++;
	//	cout<<x<<" "<<y<<endl;
	}
	for(ll i=1;i<=n;i++)
	{
		for(ll j=1;j<=m;j++)
		{
			cha[i][j]+=cha[i-1][j];
			cha[i][j]+=cha[i][j-1];
			cha[i][j]-=cha[i-1][j-1];
		}
	}
	ll cnt=0;
	ll ans=len1*len2-k;
	for(ll i=1;i<=n;i++)
	{
		for(ll j=1;j<=m;j++)
		{
			if(cha[i][j]==ans)
				cnt++;
		}
	}
	cout<<cnt<<endl;
	//cout<<p1<<" "<<p2<<" "<<p3<<" "<<p4<<endl;
}
int main()
{
	cin>>t;
	while(t--)
	{
		solve();
	}
}