#include <bits/stdc++.h>

using namespace std;

#define ll long long

void solve(){
    int n,m,k;cin >> n >> m >> k;
    string s;cin >> s;
    ll L=1,R=m,U=1,D=n;
    ll Height=0,Width=0;
    for(auto x : s)
    {
        if(x =='U')
            Height--;
        else if(x =='L')
            Width--;
        else if(x =='D')
            Height++;
        else if(x =='R')
            Width++;
        if((U+Height)<1)
            U++;
        else if((D+Height)>n)
            D--;
        else if((L+Width)<1)
            L++;
        else if((R+Width)>m)
            R--;
    }
    if (D < U || L > R){
        if (k == 0){
            cout << n * m << endl;
        }else{
            cout << 0 << endl;
        }
        return;
    }
    vector<vector<int>> a(n + 1,vector<int>(m + 1));
    vector<vector<int>> mp(n + 10,vector<int>(m + 10));
    vector<vector<int>> vis(n + 1,vector<int>(m + 1));
    vis[U][L] = 1;
    mp[U][L]++,mp[D + 1][L]--,mp[U][R + 1]--,mp[D + 1][R + 1]++;
    for (auto x : s){

        if (x == 'U'){
            U--,D--;
        }
        else if (x == 'D'){
            U++,D++;
        }
        else if (x == 'L'){
            L--,R--;
        }
        else if (x == 'R'){
            L++,R++;
        }
        if (vis[U][L]) continue;
        vis[U][L] = 1;
        mp[U][L]++,mp[D + 1][L]--,mp[U][R + 1]--,mp[D + 1][R + 1]++;
    }
    int res = 0;
    for (int i = 1;i <= n;i++){
        for (int j = 1;j <= m;j++){
            mp[i][j] += mp[i - 1][j] + mp[i][j - 1] - mp[i - 1][j - 1];
            if (mp[i][j] == (D - U + 1) * (R - L + 1) - k){
                res ++;
            }
        }
    }
    cout << res << endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;cin >> T;
    while (T--){
        solve();
    }

    return 0;
}