#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;
char s[1000009];
ll f[CF << 2][CF << 2];
void solve() {
	cin >> n >> m >> K;
	scanf("%s", s + 1);
	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;
	ll siz = strlen(s + 1);
	for (int i = 1; i <= siz; i++) {
		if (s[i] == 'U') u++, d++;
		else if (s[i] == 'D') u--, d--;
		else if (s[i] == 'R') l--, r--;
		else l++, r++;
		L = max(L, l);
		R = min(R, r);
		U = max(U, u);
		D = min(D, d);
	}
	if (U > D || L > R) {
		if (K == 0) printf("%d\n", n * m);
		else printf("0\n");
		return;
	}

// ¼ÆË㻹²î¼¸Ö»´üÊóÐèÒªÓö´½â¾ö
	int delta = (D - U + 1) * (R - L + 1) - K;
	if (delta < 0) {
		printf("0\n");
		return;
	}

	// ¼Ç¼¶´µÄÆ«ÒÆÁ¿
	// Æ«ÒÆÁ¿·¶Î§ÊÇ [-n, n] ÒÔ¼° [-m, m]£¬Òò´Ë¶¼¼ÓÉÏ n + 1 ºÍ m + 1 ±ä³É·Ç¸ºÊý
	for (int i = 0; i <= n * 2 + 5; i++) for (int j = 0; j <= m * 2 + 5; j++) f[i][j] = 0;
	int BIAS_R = n + 1, BIAS_C = m + 1;
	f[BIAS_R][BIAS_C] = 1;
	for (int i = 1, r = BIAS_R, c = BIAS_C; s[i]; i++) {
		if (s[i] == 'U') r++;
		else if (s[i] == 'D') r--;
		else if (s[i] == 'L') c++;
		else if (s[i] == 'R') c--;
		f[r][c] = 1;
	}
	// ¶þάǰ׺ºÍ
	for (int i = 1; i <= n * 2 + 5; i++) for (int j = 1; j <= m * 2 + 5; j++) f[i][j] += f[i][j - 1];
	for (int i = 1; i <= n * 2 + 5; i++) for (int j = 1; j <= m * 2 + 5; j++) f[i][j] += f[i - 1][j];

	ll ans = 0;
	// ö¾Ù¶´µÄ³õʼ×ø±ê
	for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) {
			int biasR = BIAS_R - i, biasC = BIAS_C - j;
			int t = f[D + biasR][R + biasC] - f[U - 1 + biasR][R + biasC] - f[D + biasR][L - 1 + biasC] + f[U - 1 + biasR][L - 1 + biasC];
			if (t == delta) ans++;
		}
	printf("%d\n", ans);
}

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
*/