#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e3+5;
void solve() {
	int n,m,k,count=0;
	cin>>n>>m>>k;
	string a;
	cin>>a;
	int l1=1,r1=n,l2=1,r2=m,l1min=1,r1max=n,l2min=1,r2max=m;
	for(int i=0; i<a.size(); i++) {
		if(a[i]=='U') {
			l1--,r1--;
			l1min=min(l1,l1min);
			r1max=max(r1max,r1);
		} else if(a[i]=='D') {
			l1++,r1++;
			l1min=min(l1,l1min);
			r1max=max(r1max,r1);
		} else if(a[i]=='L') {
			l2--,r2--;
			l2min=min(l2,l2min);
			r2max=max(r2max,r2);
		} else {
			l2++,r2++;
			l2min=min(l2,l2min);
			r2max=max(r2max,r2);
		}
	}
	int x1=2-l1min,x2=n-(r1max-n),y1=2-l2min,y2=m-(r2max-m);
	if(x1>x2||y1>y2) {
		if(k) cout<<0<<"\n";
		else cout<<n*m<<"\n";
	} else {
		int p=(x2-x1+1)*(y2-y1+1);
		vector<vector<int>> d(n+10,vector<int>(m+10)),v(n+10,vector<int>(m+10));
		string s=a;
		for(int i=0; i<s.size(); i++) {
			if(!v[x1][y1]) {
				d[x1][y1]++;
				d[x2+1][y1]--;
				d[x1][y2+1]--;
				d[x2+1][y2+1]++;
				v[x1][y1]=1;
			}
			if(s[i]=='U') x1--,x2--;
			else if(s[i]=='D') x1++,x2++;
			else if(s[i]=='L') y1--,y2--;
			else y1++,y2++;
		}
		if(!v[x1][y1]) {
			d[x1][y1]++;
			d[x2+1][y1]--;
			d[x1][y2+1]--;
			d[x2+1][y2+1]++;
			v[x1][y1]=1;
		}
		vector<vector<int>> c(n+10,vector<int>(m+10));
		c[1][1]=d[1][1];
		for(int i=2; i<=m; i++) c[1][i]=d[1][i]+c[1][i-1];
		for(int i=2; i<=n; i++) c[i][1]=d[i][1]+c[i-1][1];
		for(int i=2; i<=n; i++) {
			for(int j=2; j<=m; j++) {
				c[i][j]=d[i][j]+c[i-1][j]+c[i][j-1]-c[i-1][j-1];
			}
		}
		int sum=0;
		for(int i=1; i<=n; i++) {
			for(int j=1; j<=m; j++) {
				//cout<<c[i][j]<<" ";
				if(c[i][j]==p-k) sum++;
			}
			//cout<<endl;
		}
		cout<<sum<<"\n";
	}
}
signed main() {
	int T=1;
	cin>>T;
	while(T--) {
		solve();
	}
}