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

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

int main()
{
	scanf("%d",&t);
	while (t --)
	{
		ans = 0;
		scanf("%d%d%d",&n,&m,&K);
		for (int i = 1;i <= n;i ++)
			for (int j = 1;j <= m;j ++)
				cnt[i][j] = 0;
		scanf("%s",s + 1);
		len = strlen(s + 1);
		int maxx = 0,minx = 0,maxy = 0,miny = 0;
		int x = 0,y = 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);
		}
//		printf("%d %d %d %d\n",maxx,minx,maxy,miny);
		for (int i = maxx + 1;i <= n + minx;i ++)
			for (int j = maxy + 1;j <= m + miny;j ++)
			{
				int nx = i,ny = j;
				cnt[nx][ny] ++;
				for (int k = 1;k <= len;k ++)
				{
					if (s[k] == 'U') nx --;
					else if (s[k] == 'D') nx ++;
					else if (s[k] == 'L') ny --;
					else ny ++;
					cnt[nx][ny] ++;
				}
			}
		for (int i = 1;i <= n;i ++)
			for (int j = 1;j <= m;j ++)
				if (cnt[i][j] == max(0,n + minx - maxx) * max(0,m + miny - maxy) - K)
					ans ++;//printf("%d %d\n",i,j);
		printf("%d\n",ans);
	}
}