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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int t;
    cin >> t;

    auto solve = [&]() {
        int n, m, k;
        cin >> n >> m >> k;

        string s;
        cin >> s;

        int x = 0, y = 0;
        int U = 0, D = n - 1, L = 0, R = m - 1;

        // x, y -> U <= i - x <= D -> i - D <= x <= i - U

        vector a(2 * n + 1, vector<int>(2 * m + 1));
        a[n][m] = 1;

        for (auto ch : s) {
            if (ch == 'U') {
                x--;
            } else if (ch == 'D') {
                x++;
            } else if (ch == 'L') {
                y--;
            } else {
                y++;
            }
            U = max(U, -x);
            D = min(D, n - 1 - x);
            L = max(L, -y);
            R = min(R, m - 1 - y);
            if (abs(x) < n && abs(y) < m) {
                a[x + n][y + m] = 1;
            }
        }

        k = n * m - k;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (i < U || i > D || j < L || j > R) {
                    k--;
                }
            }
        }

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

        for (int i = 0; i <= 2 * n; i++) {
            for (int j = 1; j <= 2 * m; j++) {
                a[i][j] += a[i][j - 1];
            }
        }
        for (int j = 0; j <= 2 * m; j++) {
            for (int i = 1; i <= 2 * n; i++) {
                a[i][j] += a[i - 1][j];
            }
        }

        int ans = 0;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                int u = i - D + n, d = i - U + n, l = j - R + m, r = j - L + m;
                ans += a[d][r] - a[u - 1][r] - a[d][l - 1] + a[u - 1][l - 1] == k;
            }
        }

        cout << ans << '\n';
    };

    while (t--) {
        solve();
    }
    
    return 0;
}