#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

const int N = 1e3 + 5;

int mp[N * 2][N * 2],sum[N * 2][N * 2];
char c[N * N];
int T,n,m,k,x,y,mu,md,ml,mr,nud,nlr,ans;

int main()
{
	scanf("%d",&T);
	while(T --)
	{
		scanf("%d%d%d",&n,&m,&k);
		scanf(" %s",c);
		int len = strlen(c);
		mu = md = ml = mr = 0;
		nud = nlr = 0;
		for(int i = 0;i < len;i ++)
		{
			if(c[i] == 'U') nud --;
			else if(c[i] == 'D') nud ++;
			else if(c[i] == 'L') nlr --;
			else if(c[i] == 'R') nlr ++;
			if(nud > 0) md = max(md,nud);
			else mu = max(mu,-nud);
			if(nlr > 0) mr = max(mr,nlr);
			else ml = max(ml,-nlr);
		}
		//printf("mu = %d md = %d ml = %d mr = %d\n",mu,md,ml,mr);
		int lst = max(n - md - mu,0) * max(m - ml - mr,0);
		//printf("lst = %d\n",lst);
		if(lst < k)
		{
			printf("0\n");
		}
		else if(lst == k && k == 0)
		{
			printf("%d\n",n * m);
		}
		else
		{
			ans = 0;
			x = N, y = N;
			for(int i = N - n - 1;i <= N + n + 1;i ++)
			{
				for(int j = N - m - 1;j <= N + m + 1;j ++)
				{
					mp[i][j] = 0;
				}
			}
			for(int i = N - n - 2;i <= N + n + 2;i ++)
			{
				for(int j = N - m - 2;j <= N + m + 2;j ++)
				{
					sum[i][j] = 0;
				}
			}
			mp[N][N] = 1;
			for(int i = 0;i < len;i ++)
			{
				if(c[i] == 'U')
					x ++;
				else if(c[i] == 'D')
					x --;
				else if(c[i] == 'L')
					y ++;
				else if(c[i] == 'R')
					y --;
				mp[x][y] = 1;
			}
			//printf("***\n");
			for(int i = N - n - 1;i <= N + n + 1;i ++)
			{
				for(int j = N - m - 1;j <= N + m + 1;j ++)
				{
					sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + mp[i][j];
					//printf("%d ",mp[i][j]);
				}
				//printf("\n");
			}
			//printf("***\n");
			x = n - mu - md; y = m - ml - mr;
			for(int i = N - md;i <= N + n - md - 1;i ++)
			{
				for(int j = N - mr;j <= N + n - mr - 1;j ++)
				{
					if(sum[i][j] - sum[i - x][j] - sum[i][j - y] + sum[i - x][j - y] == lst - k) ans ++;
				}
			}
			printf("%d\n",ans);
		}
	}
}