#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForDown(i,j,k) for(int i=(j);i>=(k);--i)
#define Debug(fmt, args...) fprintf(stderr,"In function %s on line #%d: " fmt, __func__, __LINE__, ##args),fflush(stderr)
#define debug(fmt, args...) fprintf(stderr,fmt,##args),fflush(stderr)
#define within :
#define LJY main
using namespace std;
typedef long long ll;
const int N=1005;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
inline int read(){
  char ch=getchar();int x=0,f=1;
  while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9')
    x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return x*f;
}
int n,m,k;char s[N*N];int len;
int Mnx,Mny,Mxx,Mxy;
int sum[2*N][2*N];
void ljy(){
  n=read();m=read();k=read();
  For(i,0,2*n) For(j,0,2*m) sum[i][j]=0;sum[n][m]=1;
  Mnx=Mny=Mxx=Mxy=0;
  scanf("%s",s+1);len=strlen(s+1);int nx=0,ny=0;
  For(i,1,len){
    if(s[i]=='U') nx++;
    if(s[i]=='D') nx--;
    if(s[i]=='L') ny++;
    if(s[i]=='R') ny--;
    if(abs(nx)>=n||abs(ny)>=m){
      if(k==0) printf("%d\n",n*m);
      else puts("0");return;
    }sum[nx+n][ny+m]=1;
    // Debug("%d %d\n",nx+n,ny+m);
    Mnx=min(Mnx,nx);Mxx=max(Mxx,nx);
    Mny=min(Mny,ny);Mxy=max(Mxy,ny);
  }int x1=1+Mxx,x2=n+Mnx,y1=1+Mxy,y2=m+Mny;
  if(x1>x2||y1>y2){
    if(k==0) printf("%d\n",n*m);
    else puts("0");return;
  }
  k=(x2-x1+1)*(y2-y1+1)-k;
  if(k<0){puts("0");return;}
  For(i,1,2*n) For(j,1,2*m) sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
  int cnt=0;
  For(i,1,n) For(j,1,m){
    int lx=x1-i+n,rx=x2-i+n,ly=y1-j+m,ry=y2-j+m;
    // Debug("%d %d %d %d %d %d %d\n",i,j,lx,rx,ly,ry,sum[rx][ry]-sum[lx-1][ry]-sum[rx][ly-1]+sum[lx-1][ly-1]);
    if(sum[rx][ry]-sum[lx-1][ry]-sum[rx][ly-1]+sum[lx-1][ly-1]==k) cnt++;
  }printf("%d\n",cnt);
}
signed LJY(){int T=read();while(T--) ljy();}