#include<bits/stdc++.h>
using namespace std;
const int inf=1e9+10;

void solve(){

    int n,m,k;
    cin>>n>>m>>k;
    int dd=n*m;
    string s;
    cin>>s;
    int up=0,ri=0;
    int upm=-inf,upd=inf;
    int rim=-inf,rid=inf;
    for(int i=0;i<s.length();i++){

        char ch=s[i];
        if(s[i]=='U') up++;
        else if(s[i]=='D') up--;
        else if(s[i]=='R') ri--;
        else ri++;
        upm=max(upm,up);
        upd=min(upd,up);
        rim=max(rim,ri);
        rid=min(rid,ri);
    }
    n=n-abs(upm)-abs(upd);
    m=m-abs(rim)-abs(rid);
    if(n*m<=0&&k==0){

        cout<<dd<<"\n";
        return;
    } else if(n*m<=0&&k>0){

        cout<<0<<"\n";
        return;
    }
    int num=n*m-k;
    vector<vector<int>> a(abs(upm)+abs(upd)+50,vector<int>(abs(rim)+abs(rid)+50,0));
    int ix=abs(rid)+1;
    int iy=abs(upd)+1;
    int inx=ix,iny=iy;
    int ns=abs(upm)+abs(upd)+1;
    int ms=abs(rim)+abs(rid)+1;
    a[ix][iy]=1;
    for(int i=0;i<s.length();i++){

        if(s[i]=='U') iy++;
        else if(s[i]=='D') iy--;
        else if(s[i]=='R') ix--;
        else ix++; 
        a[iy][ix]=1;
    }
    // for(int i=1;i<=ns;i++){

    //     for(int j=1;j<=ms;j++){

    //         cout<<a[i][j];
    //     }
    //     cout<<"\n";
    // }
    for(int i=1;i<=ns;i++){

        for(int j=1;j<=ms;j++){

            a[i][j]+=a[i-1][j];
        }
    }

    for(int i=1;i<=ns;i++){

        for(int j=1;j<=ms;j++){

            a[i][j]+=a[i][j-1];
        }
    }
    // for(int i=1;i<=ns;i++){

    //     for(int j=1;j<=ms;j++){

    //         cout<<a[i][j];
    //     }
    //     cout<<"\n";
    // }
    n=n+abs(upm)+abs(upd);
    m=m+abs(rim)+abs(rid);
    // cout<<ns<<" "<<ms<<"\n";
    // cout<<iny<<" "<<inx<<"\n";
    int ans=0;
    // cout<<py<<" "<<px<<"\n";
    // cout<<1+upm<<" "<<1+rim<<"\n";
    // cout<<n+upd<<" "<<m+rid<<"\n";
    // cout<<num<<'\n';
    for(int i=1;i<=n;i++){

        for(int j=1;j<=m;j++){

            if(ns+i-iny<1+upm||ms-inx+j<1+rim||i+1-iny>n+upd||j+1-inx>m+rid) {
                
                if(num==0) ans++;
                continue;
            }
            // cout<<i-iny+1<<" "<<j-inx+1<<" "<<ns+i-iny<<" "<<ms-inx+j<<"\n";
            // cout<<1+upm<<" "<<1+rim<<" "<<n+upd<<" "<<m+rid<<"\n";
            int n2=min(ns+i-iny,n+upd),m2=min(ms-inx+j,m+rid);
            int n1=max(1+i-iny,1+upm),m1=max(1+j-inx,1+rim);
            // cout<<i<<" "<<j<<"\n";
            // cout<<n2<<" "<<m2<<" "<<n1<<" "<<m1<<"\n";
            // int dy=n2-n1+1,dx=m2-m1+1;
            int py=i-iny+1,px=j-inx+1;
            int now=a[n2-py+1][m2-px+1]-a[n1-py][m2-px+1]-a[n2-py+1][m1-px]+a[n1-py][m1-px];
            // cout<<i<<" "<<j<<" "<<now<<"\n";
            if(now==num) ans++;
        }
    }
    cout<<ans<<"\n";
    a.clear();
}
int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--){

        solve();
    }
}