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

using namespace std;

typedef long double ld;
typedef long long ll;

bool used[2005][2005];
int pref[2005][2005];

int summa(int x1, int y1, int x2, int y2)
{
 	return pref[x2][y2] - pref[x1 - 1][y2] - pref[x2][y1 - 1] + pref[x1 - 1][y1 - 1];
}

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++;
	 	 	if (c == 'D') balV--;
	 	 	if (c == 'L') balH++;
	 	 	if (c == 'R') balH--;

	 	 	maxU = max(maxU, balV);
	 	 	maxD = max(maxD, -balV);
	 	 	maxL = max(maxL, balH);
	 	 	maxR = max(maxR, -balH);
	 	}

	 	int ostN = max(0, n - maxU - maxD), ostM = max(0, m - maxL - maxR);

	 	if (ostN * ostM < k) {cout << "0\n"; continue;}
	 	if (ostN == 0 || ostM == 0) {cout << n * m << '\n'; continue;}

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

	 	int startx = n, starty = m;
	 	used[startx][starty] = true;
	 	for (int i = 0; i < (int) s.length(); i++)
	 	{
	 	 	char c = s[i];
	 	 	if (c == 'U') startx++;
	 	 	if (c == 'D') startx--;
	 	 	if (c == 'L') starty++;
	 	 	if (c == 'R') starty--;

	 	 	if (1 <= startx && startx <= 2 * n - 1 && 1 <= starty && starty <= 2 * m - 1) used[startx][starty] = true;
	 	}

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

	 	int ans = 0;
	   	for (int i = 1; i <= n; i++)
	   		for (int j = 1; j <= m; j++)
	   		{
	   			int s = summa(i + maxU, j + maxL, i + maxU + ostN - 1, j + maxL + ostM - 1);
	   			if (ostN * ostM - s == k) ans++;
	   		}
	   	cout << ans << '\n';
	}

	return 0;
}