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

int t,n,m,K;
char s[1000010];
int len;
int vis[1010][1010],tree[1010][1010],ans;

void ini()
{
	for (int i = 1;i <= n;i ++)
		for (int j = 1;j <= m;j ++)
			vis[i][j] = tree[i][j] = 0;
	ans = 0;
}

int lowbit(int x) {return x & (-x);}

void add(int x,int y,int k)
{
	for (int i = x;i <= n;i += lowbit(i))
		for (int j = y;j <= m;j += lowbit(j))
			tree[i][j] += k;
}

int query(int x,int y)
{
	int res = 0;
	for (int i = x;i;i -= lowbit(i))
		for(int j = y;j;j -= lowbit(j))
			res += tree[i][j];
	return res;
}

int main()
{
	scanf("%d",&t);
	while (t --)
	{
		scanf("%d%d%d",&n,&m,&K);
		ini();
		scanf("%s",s + 1);
		len = strlen(s + 1);
		int x = 0,y = 0,maxx = 0,minx = 0,maxy = 0,miny = 0;
		for (int i = 1;i <= len;i ++)
		{
			if (s[i] == 'U') x ++;
			else if (s[i] == 'D') x --;
			else if (s[i] == 'L') y ++;
			else y --;
			maxx = max(maxx,x),minx = min(minx,x);
			maxy = max(maxy,y),miny = min(miny,y);
		}
		int xl = maxx + 1,xr = n + minx;
		int yl = maxy + 1,yr = m + miny;
		if (xl > xr || yl > yr)
		{
			if (!K) printf("%d\n",n * m);
			else printf("0\n");
			continue;
		}
		int nx = xl,ny = yl;
//		printf("%d %d %d %d\n",xl,xr,yl,yr);
		add(nx,ny,1),add(nx,ny + yr - yl + 1,-1),add(nx + xr - xl + 1,ny,-1),add(nx + xr - xl + 1,ny + yr - yl + 1,1);
		for (int i = 1;i <= len;i ++)
		{
			vis[nx][ny] = 1;
			if (s[i] == 'U') nx --;
			else if (s[i] == 'D') nx ++;
			else if (s[i] == 'L') ny --;
			else ny ++;
//			printf("nx %d ny %d\n",nx,ny);
			if (vis[nx][ny]) continue;
			add(nx,ny,1),add(nx,ny + yr - yl + 1,-1),add(nx + xr - xl + 1,ny,-1),add(nx + xr - xl + 1,ny + yr - yl + 1,1);
//			printf("%d\n",query(nx,ny));
		}
		for (int i = 1;i <= n;i ++)
			for (int j = 1;j <= m;j ++)
			{
//				printf("que %d %d %d\n",i,j,query(i,j));
				if (query(i,j) == (xr - xl + 1) * (yr - yl + 1) - K) ans ++;
			}
		printf("%d\n",ans);
	}
}