#include<bits/stdc++.h>

using namespace std;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> mp(n+10, vector<int>(m+10));
    vector<vector<int>> vis(n+10, vector<int>(m+10));
    string s;
    cin >> s;
    int L = 1, R = m;
    int U = 1, D = n;
    int curL = 1, curR = m;
    int curU = 1, curD = n;
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == 'L') {
            curL++, curR++;
        } else if (s[i] == 'R') {
            curL--; curR--;
        } else if (s[i] == 'U') {
            curU++; curD++;
        } else {
            curU--; curD--;
        }
        L = max(curL, L);
        R = min(curR, R);
        U = max(curU, U);
        D = min(curD, D);
    }
    if (U > D || L > R) {
        if (k == 0) cout << n * m << '\n';
        else cout << 0 << '\n';
        return;
    }
    int xa = U, ya = L;
    int xb = D, yb = R;
    auto add = [&](int x1, int y1, int x2, int y2) {
        if (vis[x1][y1]) return;
        vis[x1][y1] = 1;
        mp[x1][y1]++;
        mp[x2+1][y1]--;
        mp[x1][y2+1]--;
        mp[x2+1][y2+1]++;
    };
    add(xa, ya, xb, yb);
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == 'L') {
            ya--; yb--;
        } else if (s[i] == 'R') {
            ya++; yb++;
        } else if (s[i] == 'U') {
            xa--; xb--;
        } else {
            xa++; xb++;
        }
        add(xa, ya, xb, yb);
    }
    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];
        }
    }
    int cnt = (D - U + 1) * (R - L + 1);
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (cnt - mp[i][j] == k) 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;
}