#include <iostream>
#include <cstring>
#include <cstdio>
#define N 1005
using namespace std;
int map[N << 1][N << 1],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][m] = 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 + nowx][m + nowy] = 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;}
//		puts("--------------");
//		printf("now minn=%d maxn=%d\n    minm=%d maxm=%d\n",minn,maxn,minm,maxm);
//		for (int x = n + 1,y = m + 1, a = 0 ; a < s.length() ; ++ a) {
//			switch (s[a]) {
//				case 'U': --y;
//				case 'D': ++y;
//				case 'L': --x;
//				case 'R': ++x;
//			}
//			map[x][y] = 1;
//		}
//		puts("---------------");
//		for (int a = 1 ; a <= (n << 1 | 1) ; ++ a,puts(""))
//		for (int b = 1 ; b <= (m << 1 | 1) ; ++ b) printf("%d ",map[a][b]);
		for (int a = 1 ; a <= (n << 1 | 1) ; ++ a)
		for (int b = 1 ; b <= (m << 1 | 1) ; ++ b) map[a][b] += map[a - 1][b];
		for (int a = 1 ; a <= (n << 1 | 1) ; ++ a)
		for (int b = 1 ; b <= (m << 1 | 1) ; ++ b) map[a][b] += map[a][b - 1];
		for (int a = 0 ; a < n ; ++ a)
		for (int b = 0 ; b < m ; ++ b) {
			int y = min(a + nowy, n << 1 | 1), x = min(b + nowx, m << 1 | 1);
			if (map[y][x] - map[a][x] -
				map[y][b] + map[a][b] == jud) ++ ans;
		}
		printf("%d\n",ans);
	}
	return 0;
}