#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

const int N = 1e3;
const int NM = 1e6;

	int n, m, k;
	
int c2t(char ch){
	if(ch == 'U')
		return 0;
	if(ch == 'D')
		return 1;
	if(ch == 'L')
		return 2;
	if(ch == 'R')
		return 3;
	return -1;
}

int rev(int t){
	return t ^ 1;
}

const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};

	int s[N * 2 + 3][N * 2 + 3];

int sum(int stx, int sty, int edx, int edy){
	return s[edx][edy] - s[stx - 1][edy] - s[edx][sty - 1] + s[stx - 1][sty - 1];
}
	
void sol(){
	scanf("%d%d%d\n", &n, &m, &k);
	
//	printf("%d %d %d\n", n, m, k);
	
	char ch = getchar();
	int l = 0, dir;
	int delx, dely;
	int maxu, maxd, maxl, maxr;
	delx = dely = maxu = maxd = maxl = maxr = 0;
	
	int holx, holy;
	for(int i = 1; i <= n * 2; i++)
		for(int j = 1; j <= m * 2; j++)
			s[i][j] = 0;
	s[holx = n][holy = m] = 1;
	
	while(c2t(ch) >= 0){
		dir = c2t(ch);
		
//		printf("%d", dir);
		
		delx += dx[dir];
		dely += dy[dir];
		if(delx < 0)
			maxu = max(maxu, abs(delx));
		else 
			maxd = max(maxd, abs(delx));
		if(dely < 0)
			maxl = max(maxl, abs(dely));
		else 
			maxr = max(maxr, abs(dely));
		
		dir = rev(dir);
		holx += dx[dir];
		holy += dy[dir];
		if(1 <= holx && holx <= n * 2 && 1 <= holy && holy <= m * 2)
			s[holx][holy] = 1;
		
		ch = getchar();
	}
	
//	printf("\n");
	
	int stx = n - 1 + maxu + 1, sty = m - 1 + maxl + 1;
	int edx = n - 1 + n - maxd, edy = m - 1 + m - maxr;
	
//	printf("ud[%2d,%2d]  lr[%2d,%2d]\n", maxu, maxd, maxl, maxr);
//	printf("st[%2d,%2d]  ed[%2d,%2d]\n", stx, sty, edx, edy);
//	for(int i = 1; i <= n * 2; i++){
//		for(int j = 1; j <= m * 2; j++)
//			printf("%3d", s[i][j]);
//		printf("\n");
//	}
//	printf("\n");
	
	if(maxu >= n || maxd >= n || maxl >= m || maxr >= m){
		if(k == 0)
			printf("%d\n", n * m);
		else 
			printf("0\n");
		return ;
	}
	
	for(int i = 1; i <= n * 2; i++)
		for(int j = 1; j <= m * 2; j++)
			s[i][j] = s[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
			
//	for(int i = 1; i <= n * 2; i++){
//		for(int j = 1; j <= m * 2; j++)
//			printf("%3d", s[i][j]);
//		printf("\n");
//	}
//	printf("\n");
	
	int ans = 0;
	for(int p = 0; p <= n - 1; p++)
		for(int q = 0; q <= m - 1; q++)
			if(sum(stx - p, sty - q, edx - p, edy - q) == k)
				ans++;
	
	printf("%d\n", ans);
	
}

int main(){
	memset(s, 0 , sizeof s);

	int T;
	scanf("%d", &T);
	while(T--)
		sol();

	return 0;

}