#include <bits/stdc++.h>
#define For(i,x,y) for (int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (int i=(x);i<(y);i++)
#define Dow(i,x,y) for (int i=(x);i>=(y);i--)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define siz(x) ((int)x.size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef vector<int> poly;

inline ll read(){
    ll x;
    scanf("%lld",&x);
    return x;
}

const int N = 1010, M = 1e6+10;
int n,m,k,len;
char s[M];

int f[N][N];
inline void Add(int x1,int y1,int x2,int y2,int z){
    x1=max(1,x1),y1=max(1,y1);
    x2=min(x2,n),y2=min(y2,m);
    f[x1][y1]+=z;
    f[x1][y2+1]-=z;
    f[x2+1][y1]-=z;
    f[x2+1][y2+1]+=z;
}

inline void solve(){
    n=read(),m=read(),k=read();
    scanf("%s",s+1);
    len=strlen(s+1);
    int x=0,y=0,mxx=0,mnx=0,mxy=0,mny=0;
    For(i,1,len){
        if (s[i]=='U') --x;
        if (s[i]=='D') ++x;
        if (s[i]=='L') --y;
        if (s[i]=='R') ++y;
        mxx=max(mxx,x);
        mnx=min(mnx,x);
        mxy=max(mxy,y);
        mny=min(mny,y);
    }
    map<pa,bool>vis;
    For(i,1,n) For(j,1,m) f[i][j]=0;
    int lx=1-mnx,rx=n-mxx;
    int ly=1-mny,ry=m-mxy;
    x=0,y=0;
    For(i,0,len){
        if (i>=1){
            if (s[i]=='U') ++x;
            if (s[i]=='D') --x;
            if (s[i]=='L') ++y;
            if (s[i]=='R') --y;
        }
        if (lx>rx||ly>ry) continue;
        if (vis[mp(x,y)]) continue;
        vis[mp(x,y)]=1;
        Add(lx-x,ly-y,rx-x,ry-y,1);
    }
    int ans=0;
    For(i,1,n) For(j,1,m){
        f[i][j]+=f[i-1][j]+f[i][j-1]-f[i-1][j-1];
        int t=max(0,n-mxx+mnx)*max(0,m-mxy+mny);
        t-=f[i][j];
        if (t==k) ++ans;
    }
    printf("%d\n",ans);
}

int main(){
    //freopen("a.out","w",stdout);
    int T=read();
    while (T--) solve();
}

/*
1
4 5 3
ULDDRR
*/