#include<bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
typedef pair<int, int> pii;
const int inf = 1e18;
const int N = 2e5 + 5;

map<char,pii> op;
void init(){
    op['U'] = {-1,0};
    op['L'] = {0,-1};
    op['D'] = {1,0};
    op['R'] = {0,1};
}

void solve() {
    int n,m,k;
    cin>>n>>m>>k;
    string s;cin>>s;

    int x = 1,y = 1,nn = n,mm = m;
    stack<char> xx,yy;

    for(auto ch:s){
        if(mm <= 0 || nn <= 0){
            if(k == 0)cout<<n*m<<endl;
            else cout<<0<<endl;
            return;
        }
        if(ch == 'U' || ch == 'D'){
            if(xx.empty() || xx.top() == ch){
                xx.push(ch);
                nn--;
                if(ch == 'U')x++;
            }else xx.pop();
        }else{
            if(yy.empty() || yy.top() == ch){
                yy.push(ch);
                mm--;
                if(ch == 'L')y++;
            }else yy.pop();
        }
    }

    vector<vector<int>> fl(n+5,vector<int> (m+5,0));
    vector<vector<int>> mp(n+5,vector<int> (m+5,0));

    fl[x][y] = 1;
    mp[x][y] ++;mp[x+nn][y+mm]++;
    mp[x+nn][y]--;mp[x][y+mm]--;

    for(auto ch:s){
        x += op[ch].first;y += op[ch].second;
        if(fl[x][y])continue;
        fl[x][y] = 1;
        mp[x][y] ++;mp[x+nn][y+mm]++;
        mp[x+nn][y]--;mp[x][y+mm]--;
    }
    if(k > nn*mm) {
        cout << 0 << endl;
        return;
    }
    int ans = 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] == nn*mm-k)ans++;
        }
    }
    cout<<ans<<endl;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    init();
    while (_--) {
        solve();
    }

    return 0;
}