#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

void solve() {
    int n, m, k, ans;
    string s;
    cin>>n>>m>>k>>s;
    int len=s.size();
    s=" "+s;
    int U = 1, D = n, L = 1, R = m;
    int i = 1, u = 1, d = n, l = 1, r = m;
    for (int i=1;i<=len;i++) {
        if (s[i] == 'U') u++, d++;
        else if (s[i] == 'D') u--, d--;
        else if (s[i] == 'L') l++, r++;
        else l--, r--;
        U = max(U, u);
        D = min(D, d);
        L = max(L, l);
        R = min(R, r);
    }

    if (U > D || L > R) {
        if (k == 0) cout<<n * m<<'\n';
        else cout<<0<<'\n';
        return;
    }

    int left = (D - U + 1) * (R - L + 1) - k;
    if (left < 0) {
        cout<<0<<'\n';
        return;
    }

    vector f(2*n+10,vector<i64>(2*m+10));
    for (int i = 0; i <= n * 2 + 5; i++) for (int j = 0; j <= m * 2 + 5; j++) f[i][j] = 0;
    int BIAS_R = n + 1, BIAS_C = m + 1;
    f[BIAS_R][BIAS_C] = 1;
    r = BIAS_R;
    int c = BIAS_C;
    for (int i = 1; i<=len; i++) {
        if (s[i] == 'U') r++;
        else if (s[i] == 'D') r--;
        else if (s[i] == 'L') c++;
        else if (s[i] == 'R') c--;
        f[r][c] = 1;
    }
    for (int i = 1; i <= n * 2 + 5; i++) for (int j = 1; j <= m * 2 + 5; j++) f[i][j] += f[i][j - 1];
    for (int i = 1; i <= n * 2 + 5; i++) for (int j = 1; j <= m * 2 + 5; j++) f[i][j] += f[i - 1][j];

    ans = 0;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) {
        int biasR = BIAS_R - i, biasC = BIAS_C - j;
        int t = f[D + biasR][R + biasC] - f[U - 1 + biasR][R + biasC] - f[D + biasR][L - 1 + biasC] + f[U - 1 + biasR][L - 1 + biasC];
        if (t == left) ans++;
    }
    cout<<ans<<'\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}