#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pll pair<int,int>
#define fi first
#define se second
typedef long long LL;
typedef unsigned long long ull;
int n,m,k;
const int N=1e3+10,M=1e5+10,mod=45989;
int res,cnt;
int dp[N][N];

map<char,pll> mp;

void add(int x1,int y1,int x2,int y2)
{
	dp[x1][y1]++;
	dp[x2+1][y2+1]++;
	dp[x1][y2+1]--;
	dp[x2+1][y1]--;
}

void solve() {
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++) dp[i][j]=0;
	}
	string s;
	cin>>s;
	int x=0,y=0,L=0,R=0,U=0,D=0;
	for(auto it:s)
	{
		if(it=='U') x--;
		if(it=='D') x++;
		if(it=='L') y--;
		if(it=='R') y++;
		L=min(L,y);
		R=max(R,y);
		U=min(U,x);
		D=max(D,x);
	}
	L=-L+1;
	U=-U+1;
	R=m-R;
	D=n-D;
	x=U,y=L;
	int lx=D-U,ly=R-L;
	int tmp=(lx+1)*(ly+1)-k;
	if(L>R||U>D)
	{
		if(k==0)
		cout<<n*m<<endl;
		else cout<<0<<endl;
		return;
	}
	add(x,y,x+lx,y+ly);
	for(auto it:s)
	{
		x+=mp[it].fi,y+=mp[it].se;
		add(x,y,x+lx,y+ly);
	}
	res=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			dp[i][j]+=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
			if(dp[i][j]==tmp) res++;
		}
	}
	cout<<res<<endl;
	
}


signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    cin>>T;
    mp['U']={-1,0};
    mp['D']={1,0};
    mp['L']={0,-1};
    mp['R']={0,1};
    while(T--)solve();
    return 0;
}
/*
9
0 0 0 0 0 -1 -1 -1 -1
*/