#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;

const ll N=1010,M=1000010;
ll T,n,m,k,len,L,R,U,D,ans,sum[N<<1][N<<1];
char s[M];
struct node{
	ll x,y;
}now;
vector<node> hole;

inline ll calc(ll x1,ll Y1,ll x2,ll y2){
	return sum[x2][y2]-sum[x1-1][y2]-sum[x2][Y1-1]+sum[x1-1][Y1-1];
}

inline void clean(){
	ans=0;
	for(ll i=0; i<=n*2+1; i++){
		for(ll j=0; j<=m*2+1; j++) sum[i][j]=0;
	}
	while(!hole.empty()) hole.pop_back();
}

int main(){
	scanf("%lld",&T);
	while(T--){
		clean();
		scanf("%lld %lld %lld",&n,&m,&k);
		scanf("%s",s+1); len=strlen(s+1);
		now.x=1; now.y=1;
		U=1; D=n; L=1; R=m;
		for(ll i=1; i<=len; i++){
			switch(s[i]){
				case 'U':{
					now.x++;
					U=max(now.x,U);
					break;
				}
				case 'D':{
					now.x--;
					D=min(now.x+n-1,D);
					break;
				}
				case 'L':{
					now.y++;
					L=max(now.y,L);
					break;
				}
				case 'R':{
					now.y--;
					R=min(now.y+m-1,R);
					break;
				}
				default:while(1);
			}
			hole.push_back(node{now.x-1,now.y-1});
		}
		//cout<<'L'<<L<<'R'<<R<<'U'<<U<<'D'<<D<<endl;
		hole.push_back(node{0,0});
		ll val=max(R-L+1,0ll)*max(D-U+1,0ll);
		
		if(val<k){
			printf("0\n");
			continue;
		}
		if(val==0){
			printf("%lld\n",n*m);
			continue;
		}
		
		for(ll i=0; i<(ll)hole.size(); i++){
			if(hole[i].x>=-n&&hole[i].x<=n&&hole[i].y>=-m&&hole[i].y<=m){
				sum[hole[i].x+n][hole[i].y+m]=1;
			}
		}
		for(ll i=1; i<=n*2+1; i++){
			for(ll j=1; j<=m*2+1; j++){
				sum[i][j]+=sum[i][j-1]+sum[i-1][j]-sum[i-1][j-1];
			}
		}
		
		for(ll x=1; x<=n; x++){
			for(ll y=1; y<=m; y++){
				if(calc(U+n-x,L+m-y,D+n-x,R+m-y)==val-k) ans++;
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}