#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
void Min(int &x,int y){x=min(x,y);}
void Max(int &x,int y){x=max(x,y);}
const int N=2e3+10;
int mp[200]; P dir[200];
int pre[N][N];
void slv(){
    int n,m,k;cin>>n>>m>>k;
    string S;cin>>S;
    int x=0,y=0; int lx=0,rx=0,ly=0,ry=0;
    for(auto c:S){
        auto [dx,dy]=dir[c];
        x+=dx; y+=dy;
        Min(lx,x); Max(rx,x);
        Min(ly,y); Max(ry,y);
    }
    lx=1-lx, rx=n-rx;
    ly=1-ly, ry=m-ry;
    if(lx>rx || ly>ry){
        cout<<(k==0?n*m:0)<<'\n'; return;
    }
    int nn=2*n+5,mm=2*m+5;
    rep(i,0,nn)rep(j,0,mm)pre[i][j]=0;
    int nx=n+2,ny=m+2; pre[nx][ny]=1;
    x=nx,y=ny; //...
    for(auto c:S){
        c=mp[c]; auto [dx,dy]=dir[c];
        x+=dx; y+=dy;
        pre[x][y]=1;
    }
    rep(i,1,nn)pre[i][0]+=pre[i-1][0];
    rep(j,1,mm)pre[0][j]+=pre[0][j-1];
    rep(i,1,nn){
        rep(j,1,mm)pre[i][j]+=pre[i-1][j]+pre[i][j-1]-pre[i-1][j-1];
    }
    int lenx=rx-lx+1,leny=ry-ly+1;
    int ans=0;
    auto cal=[&](int x,int y){
        if(x<0 || y<0)return 0;
        return pre[x][y];
    };
    rep(i,1,n){
        rep(j,1,m){
            int xx=lx-i+nx,yy=ly-j+ny;
            int wx=xx+rx-lx,wy=yy+ry-ly;
            Min(wx,nn); Min(wy,mm);
            --xx; --yy;
            if(cal(wx,wy)+cal(xx,yy)-cal(xx,wy)-cal(wx,yy) == lenx*leny-k )++ans;
        }
    }
    cout<<ans<<'\n';
}
signed main(){
    IOS
    mp['U']='D'; mp['D']='U';
    mp['L']='R'; mp['R']='L';
    dir['U']={-1,0}; dir['D']={1,0};
    dir['L']={0,-1}; dir['R']={0,1};
    int T;cin>>T;
    while(T--)slv();
}