#include <bits/stdc++.h>
using namespace std;
int n, m, K, ans;
string s;
int f[1005][1005];
void ssp() {
    scanf("%d%d%d", &n, &m, &K);
    cin>>s;
	s=' '+s;
    int U =1,D=n,L=1,R=m;
    int u = 1, d = n, l = 1, r = m;
    for (int i = 1;s[i]; i++)
	 {
        if (s[i] == 'U') u++, d++;
        else if (s[i] == 'D') u--, d--;
        else if (s[i] == 'L') l++, r++;
        else l--, r--;
        U = max(U, u);
        D = min(D, d);
        L = max(L, l);
        R = min(R, r);
    }
    if (U > D || L > R)
	 {
        if (K == 0) printf("%d\n", n * m);
        else printf("0\n");
        return;
    }
    int cha = (D - U + 1) * (R - L + 1) - K;
    if (cha < 0) 
	{
        printf("0\n");
        return;
    }
    for (int i = 0; i <= n * 2 + 5; i++) 
	for (int j = 0; j <= m * 2 + 5; j++)
	 f[i][j] = 0;
    int BR = n + 1, BC = m + 1;
    f[BR][BC] = 1;
    for (int i = 1, r = BR, c = BC; s[i]; i++) {
        if (s[i] == 'U') r++;
        else if (s[i] == 'D') r--;
        else if (s[i] == 'L') c++;
        else if (s[i] == 'R') c--;
        f[r][c] = 1;
    }
    for (int i = 1; i <= n * 2 + 5; i++) 
	for (int j = 1; j <= m * 2 + 5; j++) 
	f[i][j] += f[i][j - 1];
    for (int i = 1; i <= n * 2 + 5; i++) 
	for (int j = 1; j <= m * 2 + 5; j++) 
	f[i][j] += f[i - 1][j];
    ans = 0;
    for(int i=1;i<=n;i++) 
	for(int j=1;j<=m;j++)
	 {
        int bR=BR-i,bC=BC-j;
        int t=f[D+bR][R+bC]-f[U-1+bR][R+bC]-f[D+bR][L-1+bC]+f[U-1+bR][L-1+bC];
        if(t==cha)
		  ans++;
    }
    printf("%d\n", ans);
}

int main() {
    int T; 
	scanf("%d", &T);
    while (T--) 
	ssp();
    return 0;
}