#include <bits/stdc++.h>
#define endl '\n' 
using namespace std;
using ll = long long;
typedef pair<ll, ll> PII;
const ll N = 1e3 + 5;
const ll INF = 1e18;

map <char, PII> mp = { {'L', {0, -1}}, {'R', {0, 1}}, {'U', {-1, 0}}, {'D', {1, 0}} };
ll tree[N][N];
ll n, m, k;

typedef struct INFO {
    PII ss, ee;
    bool operator<(const INFO &other) const {
        return (ss == other.ss ? ee < other.ee : ss < other.ss);
    }
}info;

void add(ll x, ll y, ll z) {
    ll memo_y = y;
    while (x <= n) {
        y = memo_y;
        while (y <= m)
            tree[x][y] += z, y += y & -y;
        x += x & -x;
    }
}
void range_add(ll xa, ll ya, ll xb, ll yb, ll z) {
    add(xa, ya, z);
    add(xa, yb + 1, -z);
    add(xb + 1, ya, -z);
    add(xb + 1, yb + 1, z);
}
ll ask(ll x, ll y) {
    ll res = 0, memo_y = y;
    while (x) {
        y = memo_y;
        while (y)
            res += tree[x][y], y -= y & -y;
        x -= x & -x;
    }
    return res;
}

void solve() {
    cin >> n >> m >> k;
    for (ll i = 0; i <= n + 1; i++){
        for (ll j = 0; j <= m + 1; j++)
            tree[i][j] = 0;
    }
    string s; cin >> s;
    ll l = s.length();
    s = ' ' + s;

    ll sx = 1, sy = 1, ex = n, ey = m;
    ll xx = 0, yy = 0;
    for (ll i = 1; i <= l; i++) {
        if (s[i] == 'L') {
            yy--; sy = max(sy, 1 - yy);
        }
        else if (s[i] == 'R') {
            yy++; ey = min(ey, m - yy);
        }
        else if (s[i] == 'U') {
            xx--; sx = max(sx, 1 - xx);
        }
        else if (s[i] == 'D') {
            xx++; ex = min(ex, n - xx);
        }
    }
    if (sx > ex || sy > ey) {
        if (k == 0) cout << n * m << endl;
        else cout << 0 << endl;
        return;
    }
    k = (ex - sx + 1) * (ey - sy + 1) - k;
    set <info> st;
    st.insert({{sx, sy}, {ex, ey}});
    // cout << sx << ' ' << sy << ' ' << ex << ' ' << ey << endl;
    for (ll i = 1; i <= l; i++) {
        sx += mp[s[i]].first, sy += mp[s[i]].second;
        ex += mp[s[i]].first, ey += mp[s[i]].second;
        // cout << sx << ' ' << sy << ' ' << ex << ' ' << ey << endl;
        st.insert({{sx, sy}, {ex, ey}});
    }
    for (auto i: st){
        // printf("%d %d %d %d\n", i.ss.first, i.ss.second, i.ee.first, i.ee.second);
        range_add(i.ss.first, i.ss.second, i.ee.first, i.ee.second, 1);
    }
    ll ans = 0;
    for (ll i = 1; i <= n; i++){
        for (ll j = 1; j <= m; j++){
            if (ask(i, j) == k) ans++; 
        }
    }
    cout << ans << endl;

    // cout << sx << ' ' << sy << ' ' << ex << ' ' << ey << endl;
    // cout << "----------\n";
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    ll t; cin >> t;
    while (t--) solve();
}