#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	string s;
	cin >> s;
	int l = 0, r = 0, u = 0, d = 0;
	int nowx = 0, nowy = 0;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == 'U') {
			nowy--;
			u = min(u, nowy);
		}
		else if (s[i] == 'D') {
			nowy++;
			d = max(d, nowy);
		}
		else if (s[i] == 'L') {
			nowx--;
			l = min(l, nowx);
		}
		else {
			nowx++;
			r = max(r, nowx);
		}
	}
	l = abs(l), u = abs(u);
	int rx = n - u - d, ry = m - l - r;
	if (rx <= 0 || ry <= 0) {
		if (k == 0)
			cout << n * m << '\n';
		else
			cout << 0 << '\n';
		return;
	}
	int rk = rx * ry - k;
	vector<vector<int>> g(2*rx + u + d + 5);
	for (int i = 0; i <= 2 * rx + u + d + 3; i++)
		g[i].resize(2 * ry + l + r + 5, 0);
	int i = d + 1 + rx, j = 1 + r + ry;
	g[i][j] = 1;
	for (int ii = 0; ii < s.size(); ii++) {
		if (s[ii] == 'U')
			i++;
		else if (s[ii] == 'D')
			i--;
		else if (s[ii] == 'L')
			j++;
		else
			j--;
		g[i][j] = 1;
	}
	int ans = 0;
	for (int i = rx+1; i <= 2*rx + u + d; i++) {
		for (int j = ry+1; j <= 2*ry + l + r; j++) {
			g[i][j] = g[i - 1][j] + g[i][j - 1] - g[i - 1][j - 1] + g[i][j];
			if (g[i][j] - g[i - rx][j] - g[i][j - ry] + g[i - rx][j - ry] == rk) {
				int f = 1;
				if (r + 1 + ry > j + r || r + 1 + ry < j - ry + 1 - l)
					f = 0;
				if (d + 1 + rx > i + d || d + 1 + rx < i - rx + 1 - u)
					f = 0;
				if (f)
					ans++;
			}
		}
	}
	cout << ans << '\n';
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t = 1;
	cin >> t;
	while (t--)
		solve();
	return 0;
}