#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 2e5+9;const ll MOD = 1e9 + 7;
ll d[1005][1005];
bool vis[1005][1005];
void add(ll lx,ll ly,ll rx,ll ry){
    d[lx][ly]++;
    d[lx][ry+1]--;
    d[rx+1][ly]--;
    d[rx+1][ry+1]++;

}
void solve(){
   ll n,m,k;cin>>n>>m>>k;
   for (ll i = 0; i <= n; i++)
    for (ll j = 0; j <= m; j++)
        d[i][j]=0,vis[i][j]=false;
   string s;cin>>s;
   if(k==0){
    cout<<n*m<<"\n";
    return;
   }
    ll lx=1,ly=1;
    ll rx=n,ry=m;
    for (ll i = 0; i < s.size(); i++)
    {
        if(s[i]=='U'){lx--;rx--;if(lx<1) lx=1;}
        if(s[i]=='D'){lx++;rx++;if(rx>n) rx=n;}
        if(s[i]=='L'){ly--;ry--;if(ly<1) ly=1;}
        if(s[i]=='R'){ly++;ry++;if(ry>m) ry=m;}
    }
    if(lx>n or ly>m or rx<1 or ry<1){
        if(k==0) cout<<n*m<<"\n";
        else cout<<0<<"\n";
        return;
    }
    ll dele=(rx-lx+1)*(ry-ly+1)-k;
    if(dele<0) {
        cout<<0<<"\n";
        return;
    }
    reverse(s.begin(),s.end());
    add(lx,ly,rx,ry);vis[lx][ly]=true;
    ll clx=lx,cly=ly,crx=rx,cry=ry;
    for (ll i = 0; i < s.size(); i++)
    {
        if(s[i]=='U'){
            lx++,rx++;
            if(vis[lx][ly]==false){
                add(lx,ly,rx,ry);
            }vis[lx][ly]=true;
        }
        if(s[i]=='D'){
            lx--,rx--;
            if(vis[lx][ly]==false){
                add(lx,ly,rx,ry);
            }vis[lx][ly]=true;
        }
        if(s[i]=='L'){
            ly++,ry++;
            if(vis[lx][ly]==false){
                add(lx,ly,rx,ry);
            }vis[lx][ly]=true;
        }
        if(s[i]=='R'){
            ly--,ry--;
            if(vis[lx][ly]==false){
                add(lx,ly,rx,ry);
            }vis[lx][ly]=true;
        }
    }
    for (ll i = 1; i <= n; i++)
    {
        for (ll j = 1; j <= m; j++)
        {
            d[i][j]+=d[i-1][j]+d[i][j-1]-d[i-1][j-1];
            
        }
    }
    ll ans=0;
    for (ll i = 1; i <= n; i++)
    {
        for (ll j = 1; j <= m; j++)
        {
            if(d[i][j]==dele) ans++;
        }
    }
    cout<<ans<<"\n";
}
int main(){
    ios;ll _=1;cin>>_;
    while (_--)solve();
    return 0;
}