#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef long double ld;

bool visited[2005][2005];
int pref[2005][2005];

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
 	ios_base::sync_with_stdio(0); cin.tie(0);

 	int test;
 	cin >> test;
 	for (int rep = 1; rep <= test; rep++)
 	{
 	 	int n, m, k;
 	 	cin >> n >> m >> k;

 	 	string s;
 	 	cin >> s;

 	 	int maxU = 0, maxD = 0, maxL = 0, maxR = 0;
 	 	int balV = 0, balH = 0;
 	 	for (char c : s)
 	 	{
 	 	 	if (c == 'U')
 	 	 	{
 	 	 	 	balV--;
 	 	 	 	maxU = max(maxU, -balV);
 	 	 	}
 	 	 	if (c == 'D')
 	 	 	{
 	 	 	 	balV++;
 	 	 	 	maxD = max(maxD, balV);
 	 	 	}
 	 	 	if (c == 'L')
 	 	 	{
 	 	 	 	balH--;
 	 	 	 	maxL = max(maxL, -balH);
 	 	 	}
 	 	 	if (c == 'R')
 	 	 	{
 	 	 	 	balH++;
 	 	 	 	maxR = max(maxR, balH);
 	 	 	}
 	 	}

 	 	int up = maxU + 1, down = n - maxD, lefts = maxL + 1, rights = m - maxR;
 	 	if (up > down || lefts > rights)
 	 	{
 	 	 	if (k == 0) cout << n * m << '\n';
 	 	 	else cout << "0\n";
 	 	 	continue;
 	 	}
 	 	int squ = (down - up + 1) * (rights - lefts + 1);

 	 	int curx = n, cury = m;
 	 	int N = 2 * n - 1, M = 2 * m - 1;
 	 	for (int i = 1; i <= N; i++)
 	 		for (int j = 1; j <= M; j++)
 	 			visited[i][j] = false;

 		visited[curx][cury] = true;
 	 	for (char c : s)
 	 	{
 	 	 	if (c == 'U') curx++;
 	 	 	if (c == 'D') curx--;
 	 	 	if (c == 'L') cury++;
 	 	 	if (c == 'R') cury--;
 	 	 	if (1 <= curx && curx <= N && 1 <= cury && cury <= M) visited[curx][cury] = true;
 	 	}

 	 	for (int i = 1; i <= N; i++)
 	 		for (int j = 1; j <= M; j++)
 	 			pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] + visited[i][j];
 	 	int ans = 0;
 	 	for (int i = 1; i <= n; i++)
 	 		for (int j = 1; j <= m; j++)
 	 		{
 	 			int x1 = i + up - 1, y1 = j + lefts - 1, x2 = i + down - 1, y2 = j + rights - 1;
 	 			int sum = pref[x2][y2] - pref[x1 - 1][y2] - pref[x2][y1 - 1] + pref[x1 - 1][y1 - 1];
 	 			if (squ - sum == k) ans++;
 	 		}
 	 	cout << ans << '\n';
 	}

 	return 0;
}