#include<bits/stdc++.h>
using namespace std;
map<char,int> gox,goy;
void slove(){
	int mp[2020][2020],f[2020][2020];
	char s[100010];
	int dx=0,dy=0;
	int minx=0,maxx=0,miny=0,maxy=0,y,x,k;
	scanf("%d %d %d",&y,&x,&k);
	scanf("%s",s);
	mp[dy+1010][dx+1010]=1;
	for(int i=0;s[i]!='\0';i++){
		dx+=gox[s[i]];
		dy+=goy[s[i]];
		mp[-dy+1010][-dx+1010]=1;
		minx=min(minx,dx);
		maxx=max(maxx,dx);
		miny=min(miny,dy);
		maxy=max(maxy,dy);
//		printf("%d %d\n",-dy,-dx);
	}
	int ymax=y-maxy,ymin=-miny;
	int xmax=x-maxx,xmin=-minx;
	int ans=(ymax-ymin)*(xmax-xmin);
//	printf("%d %d %d %d\n",ymax,ymin,xmax,xmin);
	if((ymax-ymin)<=0||(xmax-xmin)<=0){
		if(k==0) printf("%d\n",x*y);
		else
		printf("0\n");
		return ;
	}
	ans-=k;
	if(ans<0){
		printf("0\n");
		return ;
	}
	int tt=0;
	for(int fy=max(-y+ymin-2,-maxy-1);fy<=ymax;fy++){
		for(int fx=max(-x+xmin-2,-maxx-1);fx<=xmax;fx++){
			f[fy+1010][fx+1010]=f[fy-1+1010][fx+1010]+f[fy+1010][fx-1+1010]-f[fy-1+1010][fx-1+1010];
			if(mp[fy+1010][fx+1010]) f[fy+1010][fx+1010]++;
//			printf("%d %d %d %d\n",fy,fx,mp[fy+1010][fx+1010],f[fy+1010][fx+1010]);
		}
	}
	for(int fy=0;fy<y;fy++){
		for(int fx=0;fx<x;fx++){
//			printf("f[%d][%d]=%d f[%d][%d]=%d ",-fy+ymax-1,-fx+xmax-1,f[-fy+ymax-1+1010][-fx+xmax-1+1010],-fy+ymax-1,-fx+xmin-1,f[-fy+ymax-1+1010][-fx+xmin-1+1010]);
//			printf("f[%d][%d]=%d f[%d][%d]=%d\n",-fy+ymin-1,-fx+xmax-1,f[-fy+ymin-1+1010][-fx+xmax-1+1010],-fy+ymin-1,-fx+xmin-1,f[-fy+ymin-1+1010][-fx+xmin-1+1010]);
			if(f[-fy+ymax-1+1010][-fx+xmax-1+1010]-f[-fy+ymax-1+1010][-fx+xmin-1+1010]-f[-fy+ymin-1+1010][-fx+xmax-1+1010]+f[-fy+ymin-1+1010][-fx+xmin-1+1010]==ans) tt++;
		}
	}
	printf("%d\n",tt);
	return ;
}

int main(){
	gox['U']=0,goy['U']=1;
	gox['D']=0,goy['D']=-1;
	gox['L']=-1,goy['L']=0;
	gox['R']=1,goy['R']=0;
	int T=1;
	scanf("%d",&T); 
	for(int i=1;i<=T;i++) slove();
	return 0;
	
}