#include<bits/stdc++.h>
#define int long long
using namespace std;
using ll = long long;
using ld = double;
const ll mod = 1e9 + 7;
const ll inf = 1e15 + 5;
const int N = 5e6 + 5;

void solve(){
    int n,m,k;
    cin>>n>>m>>k;
    string s;
    cin>>s;
    int u=1,d=n,l=1,r=m;
    vector<char>q1,q2;
    int len=s.length();
    vector<int>num1(len+5),num2(len+5);
    for(int i=0;i<s.length();i++){
        if(s[i]=='U'||s[i]=='D') {
            q1.push_back(s[i]);
        }else{
            q2.push_back(s[i]);
        }
    }
    for(int i=0;i<q1.size();i++){
        if(i==0){
            if(s[i]=='U'){
                num1[i]=1;
            }else{
                num1[i]=-1;
            }
        }else{
            if(s[i]=='U'){
                num1[i]=num1[i-1]+1;
            }else{
                num1[i]=num1[i-1]-1;
            }
        }
    }
    for(int i=0;i<q2.size();i++){
        if(i==0){
            if(s[i]=='L'){
                num2[i]=1;
            }else{
                num2[i]=-1;
            }
        }else{
            if(s[i]=='L'){
                num2[i]=num2[i-1]+1;
            }else{
                num2[i]=num2[i-1]-1;
            }
        }
    }
    for(int i=0;i<q1.size();i++){
        if(num1[i]>0)u=max(u,1+num1[i]);
        else if(num1[i]<0)d=min(d,n-num1[i]);
    }
    for(int i=0;i<q2.size();i++){
        if(num2[i]>0)l=max(l,1+num2[i]);
        else if(num2[i]<0)r=min(r,m-num2[i]);
    }
    if(u>d||l>r){
        if(k==0)cout<<n*m<<'\n';
        else cout<<0<<'\n';
        return;
    }
    int k1=(d-u+1)*(r-l+1)-k;
    if(k1<0){
        cout<<0<<'\n';
        return;
    }
    int x=n+1,y=m+1;
    vector<vector<int> >sum(2*n+5,vector<int>(2*m+5) );
    sum[x][y]=1;
    for(int i=0;i<s.length();i++){
        if(s[i]=='U'){
            x++;
        }else if(s[i]=='D'){
            x--;
        }else if(s[i]=='L'){
            y++;
        }else{
            y--;
        }
        sum[x][y]=1;
    }
    for(int i=1;i<=2*n+1;i++){
        for(int j=1;j<=2*m+1;j++){
            sum[i][j]=sum[i][j]+sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
        }
    }
    int ans=0;
    x=n+1,y=m+1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            int xx=x-i,yy=y-j;
            int ret=sum[d+xx][r+yy]-sum[d+xx][l-1+yy]-sum[u-1+xx][r+yy]+sum[u-1+xx][l-1+yy];
            if(ret==k1){
                ans++;
            }
        }
    }
    cout<<ans<<'\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
//    cout<<fixed<<setprecision(6);
//    srand(time(0));
    int T = 1;
    cin >> T;
    while (T--)solve();
    return 0;
}