#include <bits/stdc++.h>

using namespace std;

void solve(){
    int n,m,k;cin>>n>>m>>k;
    int x1=1,y1=1,x2=n,y2=m;
    string s;cin>>s;
    for(auto i:s){
        if(i=='U'){
            x1=max(1,x1-1);
            if(x2==1){
                if(!k)cout<<n*m<<endl;
                else cout<<0<<endl;
                return;
            }
            x2=max(1,x2-1);
        }else if(i=='D'){
            if(x1==n){
                if(!k)cout<<n*m<<endl;
                else cout<<0<<endl;
                return;
            }
            x1=min(n,x1+1);
            x2=min(n,x2+1);
        }else if(i=='L'){
            y1=max(1,y1-1);
            if(y2==1){
                if(!k)cout<<n*m<<endl;
                else cout<<0<<endl;
                return;
            }
            y2=max(1,y2-1);
        }else if(i=='R'){
            if(y1==m){
                if(!k)cout<<n*m<<endl;
                else cout<<0<<endl;
                return;
            }
            y1=min(m,y1+1);
            y2=min(m,y2+1);
        }
    }
    int now=(x2-x1+1)*(y2-y1+1),x=n,y=m,f[2*n+1][2*m+1];
    memset(f,0,sizeof f);
    f[x][y]=1;
    for(int i=s.size()-1;i>=0;i--){
        if(s[i]=='U')x--;
        else if(s[i]=='D')x++;
        else if(s[i]=='L') y--;
        else y++;
        f[x][y]=1;
    }
    for (int i = 1; i <= n * 2 ; i++) for (int j = 1; j <= m * 2 ; j++) f[i][j] += f[i][j - 1];
    for (int i = 1; i <= n * 2 ; i++) for (int j = 1; j <= m * 2 ; j++) f[i][j] += f[i - 1][j];
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            int x3=x1-i+n,y3=y1-j+m,x4=x2-i+n,y4=y2-j+m;
            int t=f[x4][y4]-f[x4][y3-1]-f[x3-1][y4]+f[x3-1][y3-1];
            if(t==now-k)ans++;
        }
    }
    cout<<ans<<endl;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t; cin >> t;
    while(t--){
        solve();
    }
    return 0;
}