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

#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define ll long long
#define debug(x) cout << #x << ' ' << x << endl;

const int N = 3e3 + 10;

bool f[N][N];
int dp[N][N];

void test(){
	int n,m,k;cin >> n >> m >> k;
	for(int i = 1;i <= 2*n - 1;i++)
		for(int j = 1;j <= 2*m - 1;j++)
			f[i][j] = 0;
	string s;cin >> s;
	int t = n,b = 1,l = 1,r = m;
	int x = 0,y = 0;
	f[n][m] = 1;
	for(auto c : s){
		if(c == 'L'){
			x++;
			l = max(l,1 + x);
		}else if(c == 'R'){
			x--;
			r = min(r,m + x);
		}else if(c == 'U'){
			y--;
			t = min(t,n + y);
		}else{
			y++;
			b = max(b,1 + y);
		}
		if(x + m >= 0 && x + m <= 2*m - 1 && y + n >= 0 && y + 2*n <= 2*n - 1)
			f[y + n][x + m] = 1;
	}
	int mis = 0;
	if(!(b > t || l > r)) mis = ((t - b + 1) * (r - l + 1) - k);
	else mis = -k;
	if(mis < 0){
		cout << 0 << '\n';
	}else if(mis == 0){
		cout << n * m << '\n';
	}else{
		for(int i = 0;i <= 2*n - 1;i++){
			for(int j = 0;j <= 2*n - 1;j++){
				if(i) dp[i][j] += dp[i - 1][j];
				if(j) dp[i][j] += dp[i][j - 1];
				if(i && j) dp[i][j] -= dp[i - 1][j - 1];
				if(f[i][j])
					dp[i][j]++;
			}
		}	
		int ans = 0;
		for(int i = 1;i <= n;i++)
			for(int j = 1;j <= m;j++){
				int _t = t - i,_b = b - i,_l = l - j,_r = r - j;
				if(dp[n + _t][m + _r] + dp[n + _b - 1][m + _l - 1] - dp[n + _b - 1][m + _r] - dp[n + _r][m + _l - 1] == mis){
					ans++;
				}
			}
		cout << ans << '\n';
	}
}

int main(){
	IOS
	int t = 1;cin >> t;
	while(t--){
		test();
	}
}