//μ's forever
#include <bits/stdc++.h>
#define N 1000005
//#define getchar nc
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    register int x=0,f=1;register char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    return x*f;
}
inline void write(register int x)
{
    if(!x)putchar('0');if(x<0)x=-x,putchar('-');
    static int sta[20];register int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}
int T,n,m,k,l;
char s[N];
map<pair<int,int>,int> mp;
vector<int> v[N];
int posx,posy,lenx,leny;
void add(){
    v[posx][posy]++;
    v[posx][posy+leny]--;
    v[posx+lenx][posy]--;
    v[posx+lenx][posy+leny]++;
}
int main()
{
    scanf("%d",&T);
    while(T--){
        mp.clear();
        scanf("%d%d%d",&n,&m,&k);
        scanf("%s",s+1);
        l=strlen(s+1);
        // cerr<<l<<endl;
        int px=1,py=1,lx=1,ly=1,lex=n,ley=m;
        bool fl=0;
        for(int i=1;i<=l;++i){
            if(s[i]=='U'){
                --px;
                if(px==0) ++px,++lx,--lex;
            }else if(s[i]=='D'){
                ++px;
                if(px+lex-1>n) --lex;
            }else if(s[i]=='L'){
                --py;
                if(py==0) ++py,++ly,--ley;
            }else{
                ++py;
                if(py+ley-1>m) --ley;
            }
            if(lex==0||ley==0)
                fl=1;
        }
        if(fl){
            if(k==0) printf("%d\n",n*m);
            else puts("0");
            continue;
        }
        posx=lx,posy=ly,lenx=lex,leny=ley;
        // cerr<<posx<<" "<<posy<<" "<<lenx<<" "<<leny<<endl;
        for(int i=0;i<=n+1;++i){
            v[i].clear();
            v[i].resize(m+2);
        }
        add();
        mp[make_pair(posx,posy)]=1;
        for(int i=1;i<=l;++i){
            if(s[i]=='U'){
                --posx;
            }else if(s[i]=='D'){
                ++posx;
            }else if(s[i]=='L'){
                --posy;
            }else{
                ++posy;
            }
            if(!mp[make_pair(posx,posy)]){
                add();
                mp[make_pair(posx,posy)]=1;
            }
        }
        int nd=lenx*leny-k;
        for(int i=1;i<=n;++i)
            for(int j=1;j<=m;++j)
                v[i][j]+=v[i][j-1];
        for(int i=1;i<=n;++i)
            for(int j=1;j<=m;++j)
                v[i][j]+=v[i-1][j];
        // for(int i=1;i<=n;++i){
        //     for(int j=1;j<=m;++j){
        //         cerr<<v[i][j]<<" ";
        //     }
        //     cerr<<endl;
        // }
        int ans=0;
        for(int i=1;i<=n;++i)
            for(int j=1;j<=m;++j)
                if(v[i][j]==nd)
                    ++ans;
        printf("%d\n",ans);
    }
    return 0;
}