#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m, k;
    std::cin >> n >> m >> k;

    std::string s;
    std::cin >> s;

    int x = 0, y = 0, u = 0, d = n, l = 0, r = m;
    std::vector<std::vector<int>> a(2 * n + 1, std::vector<int>(2 * m + 1));
    a[x + n][y + m] = 1;
    for (auto c : s) {
        if (c == 'U') {
            x += 1;
        } else if (c == 'D') {
            x -= 1;
        } else if (c == 'L') {
            y += 1;
        } else if (c == 'R') {
            y -= 1;
        }
        u = std::max(u, x);
        d = std::min(d, n + x);
        l = std::max(l, y);
        r = std::min(r, m + y);
        if (u >= d || l >= r) {
            std::cout << (k == 0 ? n * m : 0) << "\n";
            return;
        }
        a[x + n][y + m] = 1;
    }

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

    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            int nu = u - i + n, nd = d - i + n, nl = l - j + m, nr = r - j + m;
            if (a[nu][nl] - a[nu][nr] - a[nd][nl] + a[nd][nr] == k) {
                ++ans;
            }
        }
    }

    std::cout << ans << "\n";
}

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

    int t;
    std::cin >> t;

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

    return 0;
}