#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=2005;
ll n,m,k,len,sum[N][N],X,Y,Lx,Rx,Ly,Ry;
char s[N*N];
ll S(ll x,ll y,ll u,ll v){
    x+=n,y+=m,u+=n,v+=m;
    return sum[u][v]-sum[x-1][v]-sum[u][y-1]+sum[x-1][y-1];
}
void solve(){
    n=read(),m=read(),k=read();
    scanf("%s",s+1);
    len=strlen(s+1);
    sum[n][m]=1;
    rep(i,1,len){
        if(s[i]=='U')X++;
        else if(s[i]=='D')X--;
        else if(s[i]=='L')Y++;
        else Y--;
        if(X+n<0||X+n>2*n||Y+m<0||Y+m>2*m)continue;
        sum[X+n][Y+m]=1;
    }
    rep(i,0,n*2){
        rep(j,1,m*2)sum[i][j]+=sum[i][j-1];
    }
    rep(i,1,n*2){
        rep(j,0,m*2)sum[i][j]+=sum[i-1][j];
    }
    X=Y=0;
    rep(i,1,len){
        if(s[i]=='U')X--;
        else if(s[i]=='D')X++;
        else if(s[i]=='L')Y--;
        else Y++;
        Lx=min(Lx,X),Rx=max(Rx,X);
        Ly=min(Ly,Y),Ry=max(Ry,Y);
    }
    ll xL=0,xR=0,yL=0,yR=0;
    rep(i,1,n){
        if(i+Lx>=1&&i+Rx<=n){
            if(!xL)xL=i;
            xR=i;
        }
    }
    rep(i,1,m){
        if(i+Ly>=1&&i+Ry<=m){
            if(!yL)yL=i;
            yR=i;
        }
    }
    if(!xL||!xR){
        if(!k)write(n*m),putchar('\n');
        else puts("0");
        return ;
    }
    ll ans=0;
    rep(i,1,n){
        rep(j,1,m){
            ll xl=xL-i,xr=xR-i,yl=yL-j,yr=yR-j;
            ll s=(xR-xL+1)*(yR-yL+1)-S(xl,yl,xr,yr);
            if(s==k)ans++;
        }
    }
    write(ans),putchar('\n');
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    ll T=read();
    while(T--)solve();
    return 0;
}