#include <bits/stdc++.h>
#define test(x) cout<<#x<<" = "<<x<<endl
#define endl '\n'
#define int long long
using namespace std;
const int MAXN = 1e3 + 100;
int n, m, k;
string s;
int a[MAXN][MAXN];

void solve() {
	cin >> n >> m >> k >> s;
	int sz = s.size();
	s = "#" + s;
	for (int j = 0; j <= m + 1; ++j)
		for (int i = 0; i <= n + 1; ++i)
			a[i][j] = 0;
	int x = 0, y = 0, u = 0, d = 0, l = 0, r = 0;
	for (int i = 1; i <= sz; ++i) {
		if (s[i] == 'U')
			++y;
		else if (s[i] == 'D')
			--y;
		else if (s[i] == 'L')
			--x;
		else if (s[i] == 'R')
			++x;
		u = max(u, y);
		d = min(d, y);
		l = min(l, x);
		r = max(r, x);
	}
	if (m - r < 1 - l || n - u < 1 - d) {
		if (k == 0)
			cout << m *n << endl;
		else
			cout << 0 << endl;
		return ;
	}
	x = -l + 1, y = -d + 1;
	int dx = m + l - r, dy = n + d - u;
	a[y][x] = 1;
	for (int i = 1; i <= sz; ++i) {
		if (s[i] == 'U')
			++y;
		else if (s[i] == 'D')
			--y;
		else if (s[i] == 'L')
			--x;
		else if (s[i] == 'R')
			++x;
		a[y][x] = 1;
	}
	for (int i = n; i >= 1; --i)
		for (int j = m; j >= 1; --j)
			a[i][min(m + 1, j + dx)] -= a[i][j];
//	for (int i = 1; i <= n; ++i)
//		for (int j = 1; j <= m; ++j)
//			cout << a[i][j] << " \n"[j == m];

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

//	for (int i = 1; i <= n; ++i)
//		for (int j = 1; j <= m; ++j)
//			cout << a[i][j] << " \n"[j == m];

	for (int i = n; i >= 1; --i)
		for (int j = m; j >= 1; --j)
			a[min(n + 1, i + dy)][j] -= a[i][j];
	for (int j = 1; j <= m; ++j)
		for (int i = 1; i <= n; ++i)
			a[i][j] += a[i - 1][j];
	int ans = 0;
	for (int j = 1; j <= m; ++j)
		for (int i = 1; i <= n; ++i)
			ans += (a[i][j] == dx * dy - k);

//	for (int i = 1; i <= n; ++i)
//		for (int j = 1; j <= m; ++j)
//			cout << a[i][j] << " \n"[j == m];

	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt = 1;
	cin >> tt;
	while (tt--)
		solve();
}
/*
3
4 5 3
ULDDRR
4 5 0
UUUUUUU
4 5 10
UUUUUUU

*/