//
// Created by Zlin on 2024/10/19.
//

#include "bits/stdc++.h"

using namespace std;

typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int dif = 1005;
int n, m, k, lx, rx, ly, ry;
int sum[3020][3020];

inline void Zlin() {
    cin >> n >> m >> k;
    string s;
    cin >> s;
    int x = 0, y = 0;
    lx = ly = 1, rx = m, ry = n;
    for (auto it: s) {
        if (it == 'U') {
            y++;
            ry = min(ry, n - y);
        } else if (it == 'D') {
            y--;
            ly = max(ly, 1 - y);
        } else if (it == 'L') {
            x--;
            lx = max(lx, 1 - x);
        } else {
            x++;
            rx = min(rx, m - x);
        }
    }
//    cout << lx << ' ' << rx << ' ' << ly << ' ' << ry << '\n';
    x = 0, y = 0;
    sum[dif][dif] = 1;
    for (auto it: s) {
        if (it == 'U') {
            y--;
        } else if (it == 'D') {
            y++;
        } else if (it == 'L') {
            x++;
        } else {
            x--;
        }
        if (x < -m || x > m || y < -n || y > n) continue;
        sum[x + dif][y + dif] = 1;
    }
    for (int i = dif - m; i <= dif + m; i++)
        for (int j = dif - n; j <= dif + n; j++)
            sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
    int ans = 0, now;
    if (lx > rx || ly > ry) {
        now = -k;
    } else {
        now = 1ll * (rx - lx + 1) * (ry - ly + 1) - k;
    }
    if (now == 0) {
        ans = n * m;
    } else if (now < 0) {
        ans = 0;
    } else {
        for (int y = 1; y <= n; y++) {
            for (int x = 1, ax, ay, bx, by, check; x <= m; x++) {
                ax = rx - x + dif, ay = ry - y + dif;
                bx = lx - x - 1 + dif, by = ly - y - 1 + dif;
                ax = min(ax, dif + m), ay = min(ay, dif + n);
                bx = max(bx, dif - m), by = max(by, dif - n);
                check = sum[ax][ay] - sum[ax][by] - sum[bx][ay] + sum[bx][by];
                if (check == now) ++ans;
            }
        }
    }
//    for (int i = dif - m; i <= dif + m; i++) {
//        for (int j = dif - n; j <= dif + n; j++) {
//            cout << sum[i][j] << ' ';
//        }
//        cout << '\n';
//    }
//    cout << now << ' ';
    cout << ans << '\n';

    for (int i = dif - n; i <= dif + n; i++)
        for (int j = dif - m; j <= dif + m; j++)
            sum[i][j] = 0;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int ttt = 1;
    cin >> ttt;
    while (ttt--) Zlin();
    return 0;
}