#include <iostream>
#include <cstring>
#include <cstdio>
#define N 1005
using namespace std;
int map[N * 2 + 10][N * 2 + 10],t,n,m,k;
string s;
int main() {
	scanf("%d",&t);
	while (t--) {
		scanf("%d%d%d",&n,&m,&k);
		cin >> s;
		memset(map,0,sizeof(map));
		map[n + 1][m + 1] = 1;
		int maxn = 0, minn = 0,
			maxm = 0, minm = 0,
			nowx = 0, nowy = 0;
		for (int a = 0 ; a < s.length() ; ++ a) {
			switch (s[a]) {
				case 'U': --nowy; minn = min(minn, nowy);break;
				case 'D': ++nowy; maxn = max(maxn, nowy);break;
				case 'L': --nowx; minm = min(minm, nowx);break;
				case 'R': ++nowx; maxm = max(maxm, nowx);break;
			}
			if (nowy <= -n || nowy >= n) break;
			if (nowx <= -m || nowx >= m) break;
			map[n + 1 - nowy][m + 1 - nowx] = 1;
		}
		if (nowy <= -n || nowy >= n || nowx <= -m || nowx >= m) {
			if (k == 0) printf("%d\n",n * m);
			else puts("0"); continue;
		}
		minn = 1 - minn,maxn = n - maxn;
		minm = 1 - minm,maxm = m - maxm;
		nowy = maxn - minn + 1;
		nowx = maxm - minm + 1;
		int ans = 0,jud = nowx * nowy - k;
		if (jud < 0) {puts("0"); continue;}
		for (int a = 1 ; a <= (n * 2 + 3) ; ++ a)
		for (int b = 1 ; b <= (m * 2 + 3) ; ++ b) map[a][b] += map[a - 1][b];
		for (int a = 1 ; a <= (n * 2 + 3) ; ++ a)
		for (int b = 1 ; b <= (m * 2 + 3) ; ++ b) map[a][b] += map[a][b - 1];
		for (int a = 1 ; a <= n ; ++ a)
		for (int b = 1 ; b <= m ; ++ b) {
			int y = n + 1 - a, x = m + 1 - b;
			int j = map[maxn + y][maxm + x] - map[minn - 1 + y][maxm + x] -
					map[maxn + y][minm - 1 + x] + map[minn - 1 + y][minm - 1 + x];
			if (j == jud) ++ ans;
		}
		printf("%d\n",ans);
	}
	return 0;
}