#include <bits/stdc++.h>

using namespace std;

const int N = 2e6 + 10, M = 2e3 + 10;

int n, m, k;
set<pair<int, int> > a;
char st[N];
int sum[M][M];
int main() {
	int T; scanf("%d", &T);
	while (T--) {
		a.clear();
		scanf("%d%d%d", &n, &m, &k);
		for (int i = 0; i <= n; ++i)
			for (int j = 0; j <= m; ++j)
				sum[i][j] = 0;
		scanf("%s", st + 1);
		int U = 0, D = 0, L = 0, R = 0, x = 0, y = 0;
		int len = strlen(st + 1);
		for (int i = 1; i <= len; ++i) {
			if (st[i] == 'D')
				++x;
			if (st[i] == 'U')
				--x;
			if (st[i] == 'L')
				--y;
			if (st[i] == 'R')
				++y;
			a.insert(make_pair(-x, -y));
			U = max(U, -x);
			D = max(D, x);
			L = max(L, -y);
			R = max(R, y);
		}
	//	cout << U << ' ' << D <<' ' <<L << ' ' << R << endl;
		if (U + D >= n || L + R >= m) {
			if (k == 0)
				printf("%d\n", n * m);
			else
				printf("0\n");
			continue;
		}
	//	cout << U << ' ' << D << ' ' << L << ' ' << R << endl;
		++sum[U + 1][L + 1];
		--sum[n - D + 1][L + 1];
		--sum[U + 1][m - R + 1];
		++sum[n - D + 1][m - R + 1];
		for (set<pair<int,int> >::iterator it = a.begin(); it != a.end(); it++) {
			int xx1 = U + 1 - it->first, yy1 = L + 1 - it->second;
			int xx2 = n - D - it->first, yy2 = m - R - it->second;
			xx1 = max(xx1, 1);
			yy1 = max(yy1, 1);
			xx2 = min(xx2, n);
			yy2 = min(yy2, m);
			if (xx1 > n || yy1 > m || xx2 < 1 || yy2 < 1)
				continue;
		//	cout << it->first <<' ' <<it->second << endl;
		//	cout << xx1 << ' ' << yy1 <<' ' << xx2 << ' ' << yy2 << endl;
			++sum[xx1][yy1];
			--sum[xx2 + 1][yy1];
			--sum[xx1][yy2 + 1];
			++sum[xx2 + 1][yy2 + 1];
		}
		int ans = 0;
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= m; ++j) {
				sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
				if ((n - U - D) * (m - L - R) - sum[i][j] == k)
					++ans;
			}
	/*	for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j)
				cout << (n - U - D) * (m - L - R) - sum[i][j] << ' ';
			cout << endl;
		}*/
		printf("%d\n", ans);
	}
	return 0;
}
/*
2
4 5 15
U
4 5 14
U
*/