#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=a;i < b;i++)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x.size())
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
int pref[1002][1002];
signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int t;
	cin>>t;
	while(t--){
		int n,m,k;
		cin>>n>>m>>k;
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				pref[i][j] = 0;
				
			}
		}
		int xl = 0,xr = n-1;
		int yl = 0,yr = m-1;
		string s;
		cin>>s;
		vector<pii>moved;
		int cx = 0,cy = 0;
		for(char c:s){
			if(c == 'U'){
				cx--;
				xl--;
				xr--;
				xl = max(xl,0);
			}
			if(c == 'D'){
				cx++;
				xl++;
				xr++;
				xr = min(xr,n-1);
			}	
			if(c == 'L'){
				cy--;
				yl--;
				yr--;
				yl = max(yl,0);
			}
			if(c == 'R'){
				cy++;
				yl++;
				yr++;
				yr = min(yr,m-1);
			}
			moved.push_back({cx,cy});
			if(xl > xr || yl > yr)break;
		}
		xl += cx;
		xr += cx;
		yl += cy;
		yr += cy;
		//cout<<xl<<" "<<xr<<" "<<yl<<" "<<yr<<'\n';
		if(xl > xr || yl > yr){
			if(k)cout<<0<<'\n';
			else cout<<n*m<<'\n';
			continue;
			
		}
		map<pii,int>seen;
		for(auto [x,y]:moved){
			if(seen[{x,y}])continue;
			seen[{x,y}] = 1;
			pref[xl+x][yl+y]++;
			pref[xl+x][yr+y+1]--;
			//cout<<x<<" "<<y<<'\n';
		}
		/*
	    for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				cout<<pref[i][j]<<" ";
			}
			cout<<'\n';
		}
		cout<<'\n';*/
		for(int i=0;i<n;i++){
			for(int j=1;j<m;j++){
				pref[i][j] += pref[i][j-1];
			}
		}
		
		int d = xr-xl+1;
		for(int j=0;j<m;j++){
			for(int i=1;i<n;i++)pref[i][j] += pref[i-1][j];		
			for(int i=n-1;i>=d;i--)pref[i][j] -= pref[i-d][j];
		}
		/*
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				cout<<pref[i][j]<<" ";
			}
			cout<<'\n';
		}*/
		int ans = 0;
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				int cnt = (xr-xl+1) * (yr-yl+1);
				if(cnt - pref[i][j] == k)ans++;
			}
		}
		cout<<ans<<'\n';

		
	}
	
}