#include <bits/stdc++.h>
#define endl '\n'
#define buff ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
/*
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize(3)
*/
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pair<ll, ll>> vpll;
const ll MAX_INT = 0x3f3f3f3f;
const ll MAX_LL = 0x3f3f3f3f3f3f3f3f;
const ll CF = 1e3 + 9;
const ll mod = 1e9 + 7;
ll n, m, k;
string str;
ll mp[CF << 2][CF << 2];
ll sum(ll U, ll L, ll D, ll R) {
	return mp[D][R] - mp[U - 1][R] - mp[D][L - 1] + mp[U - 1][L - 1];
}
void solve() {
	cin >> n >> m >> k >> str;
	ll L = 1, R = m, U = 1, D = n;
//	for (auto &itt : str) {
//		if (itt == 'U') U = max(1ll, U - 1), D = max(1ll, D - 1);
//		else if (itt == 'D') U = min(n, U + 1), D = min(n, D + 1);
//		else if (itt == 'L') L = max(1ll, L - 1), R = max(1ll, R - 1);
//		else L = min(m, L + 1), R = min(m, R + 1);
//	}
	ll l = 1, r = m, u = 1, d = n;
	for (auto &itt : str) {
		if (itt == 'U') u++, d++;
		else if (itt == 'D') u--, d--;
		else if (itt == 'R') l--, r--;
		else l++, r++;
		L = max(L, l);
		R = min(R, r);
		U = max(U, u);
		D = min(D, d);
	}
//	cout << L << ' ' << R << ' ' << U << ' ' << D << ' ' << endl;
	if (L > R || U > D) {
		if (k == 0) cout << n * m << endl;
		else cout << 0 << endl;
		return;
	}
	// adder =

	for (int i = 0; i <= 2 * n + 100; i++) for (int j = 0; j <= 2 * m + 100; j++) mp[i][j] = 0;
	ll x = 1 + n, y = 1 + m;
	mp[x][y] = 1;
	for (auto &itt : str) {
		if (itt == 'U') x++;
		else if (itt == 'D') x--;
		else if (itt == 'L') y++;
		else y--;
		mp[x][y] = 1;
	}

//	for (int i = 1; i <= 2 * n; i++, cout << endl) {
//		for (int j = 1; j <= 2 * m; j++) {
//			cout << mp[i][j] << ' ';
//		}
//	}
//	cout << "-------------------------------\n";

//	for (int i = 1; i <= 2 * n + 10; i++)
//		for (int j = 1; j <= 2 * m + 10; j++)
//			mp[i][j] += mp[i - 1][j] + mp[i][j - 1] - mp[i - 1][j - 1];

	for (int i = 1; i <= n * 2 + 5; i++) for (int j = 1; j <= m * 2 + 5; j++) mp[i][j] += mp[i][j - 1];
	for (int i = 1; i <= n * 2 + 5; i++) for (int j = 1; j <= m * 2 + 5; j++) mp[i][j] += mp[i - 1][j];

//	for (int i = 1; i <= 2 * n; i++, cout << endl) {
//		for (int j = 1; j <= 2 * m; j++) {
//			cout << mp[i][j] << ' ';
//		}
//	}
	ll least = (R - L + 1) * (D - U + 1) - k;
	if (least < 0) {
		cout << 0 << endl;
		return;
	}

	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			ll nx = 1 - i, ny = 1 - j;
			ll U_new = U + n + nx, D_new = D + n + nx, L_new = L + m + ny, R_new = R + m + ny;
//	printf("U = %lld, D = %lld, L = %lld, R = %lld\n", U_new, D_new, L_new, R_new);
//	cout << " :: " << sum(U_new, L_new, D_new, R_new) << endl;
			if (sum(U_new, L_new, D_new, R_new) == least) ans++;
		}
	}
	cout << ans << endl;
}

int main() {
	buff
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}
/*
3
4 5 3
ULDDRR
4 5 0
UUUUUUU
4 5 10
UUUUUUU

1
3 18 33
UDRLR
*/