#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define endl "\n"
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef pair<int, int> PII;
typedef unsigned long long ULL;
const int N = 1e6+5,mod=1e9+7,modd=998244353;
int ar[N],br[N];
int  k, s,n,m,sum1,len;
int cmp(int a, int b){	return a > b;}
int lowbit(int x){return x&(-x);}
int read() { int x=0,f=1; char c=getchar(); while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();return x*f;}
const double eps = 1e-8;
int tree[1010][1010];
int st[1010][1010];
signed main()
{
	int t=1;
	ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0);
	
	cin>>t;
	for(int ff=1;ff<= t;ff++)
	{
		int a, b,c,d, l, y, x, s, r,flag = 0,idx = 0,gg = 0,hh=0,res=0,sum=0, sum2 = 0;
		string str2,str,str3;
		
		//cin>>n;
		// for(int i=1;i<=n;i++)cin>>ar[i];
		cin>>n>>m>>k;
		memset(st, false, sizeof st), memset(tree, 0, sizeof tree);
		
		cin>>str;
		int upl=1,dol=n,lel=1,ril=m;
		int x1=lel,y1=upl,x2=ril,y2=dol;
		x=1;
		for(int i=0;i<str.length();i++)
		{
			if(str[i]=='U')y1++,y2++,upl=max(upl,y1),dol=min(dol,y2);
			if(str[i]=='D')y2--,y1--,upl=max(upl,y1),dol=min(dol,y2);
			if(str[i]=='L')x1++,x2++,lel=max(lel,x1),ril=min(ril,x2);
			if(str[i]=='R')x2--,x1--,lel=max(lel,x1),ril=min(ril,x2);
		}
		
		int yuan=(dol-upl+1)*(ril-lel+1);
		int que=yuan-k;
		
		//  cout<<yuan<<" "<<que<<endl;
		
		if(upl>dol||ril<lel)
		{
			if(k==0)cout<<n*m<<endl;
			else cout<<0<<endl;
			continue;
		}
		
		x1=upl,y1=lel,x2=dol,y2=ril;
		// cout<<upl<<" "<<dol<<" "<<lel<<" "<<ril<<endl;
		//cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
		
		st[x1][y1] = true;
		tree[x1][y1]++, tree[x2 + 1][y1]--, tree[x1][y2 + 1]--, tree[x2 + 1][y2 + 1]++;
		
		for(int i=0;i<str.length();i++)
		{
			
			if(str[i]=='U')x1--,x2--;
			if(str[i]=='D')x2++,x1++;
			if(str[i]=='L')y1--,y2--;
			if(str[i]=='R')y2++,y1++;
			// cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
			//if (st[x1][y1])continue;
			if(st[x1][y1])continue;
			st[x1][y1] = true;
			tree[x1][y1]++, tree[x2 + 1][y1]--, tree[x1][y2 + 1]--, tree[x2 + 1][y2 + 1]++;
			
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				tree[i][j] += tree[i - 1][j] + tree[i][j - 1] - tree[i - 1][j - 1];
			}
			//cout<<endl;
		}
		
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				
				//cout<<get(i,j)<<" ";
				if(tree[i][j]==que)sum++;
			}
			//cout<<endl;
		}
		cout<<sum<<endl;
	}
	return 0;
}