#include <bits/stdc++.h>
#define endl '\n'

using ll = long long;

constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;

using namespace std;

void solve(){
	int n, m, k;
	string s;
	cin >> n >> m >> k >> s;
	int U, L, u, l, D, R, d, r;
	U = L = u = l = 1;
	R = r = m, D = d = n;
	for (auto c : s) {
		if (c == 'D') u--, d--;
		else if (c == 'U') u++, d++;
		else if (c == 'L') r++, l++;
		else r--, l--;
		L = max(L, l);
		R = min(R, r);
		U = max(U, u);
		D = min(D, d);
	}
	if (L > R || U > D) {
		if (k) cout << 0 << endl;
		else cout << m * n << endl;
		return;
	}
	int lef = (D - U + 1) * (R - L + 1) - k;
	if (lef < 0) {
		cout << 0 << endl;
		return;
	} 
	vector f(n + 10, vector<int>(m + 10));
	auto add = [&](int x1, int y1, int x2, int y2) -> void {
		f[x1][y1]++;
		f[x2 + 1][y1]--;
		f[x1][y2 + 1]--;
		f[x2 + 1][y2 + 1]++;
	};
	vector vis(n + 10, vector<int>(m + 10));
	add(U, L, D, R);
	vis[U][L]++;
	for (auto c : s) {
		if (c == 'L') L--, R--;
		else if (c == 'R') L++, R++;
		else if (c == 'U') U--, D--;
		else U++, D++;
		if (vis[U][L]) continue;
		vis[U][L] = 1;
		add(U, L, D, R);	
	}

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			f[i][j] += f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1];
		}
	}

	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if (f[i][j] == lef) ans++;
		}
	}
	cout << ans << endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}