#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll n, m, k, l, r, u, d, A;
string s;
const ll inf = 2e18;
void solve() {
    cin >> n >> m >> k >> s;
    //先用边界杀袋鼠
    ll maxh = -inf, minh = inf, maxw = -inf, minw = inf, h = 0, w = 0;
    for(auto c:s) {
        if(c == 'L') w--;
        else if(c == 'R') w++;
        else if(c == 'U') h--;
        else if(c == 'D') h++;
        maxh = max(maxh, h), minh = min(minh, h);
        maxw = max(maxw, w), minw = min(minw, w);
    }

    if(minw < 0) l = abs(minw) + 1; else l = 1;
    if(maxw > 0) r = m - maxw; else r = m;
    if(minh < 0) u = abs(minh) + 1; else u = 1;
    if(maxh > 0) d = n - maxh; else d = n;

    if(l > m || r < 1 || u > n || d < 1) {
        if(k == 0) {
            cout << n * m << endl;
        } else {
            cout << 0 << endl;
        }
        return ;
    }
    A = (r - l + 1) * (d - u + 1);
    // cout << l << " " << r << " " << u << " " << d << " " << A << endl;

    //下面确定cave的移动轨迹
    vector<vector<int> > a(2 * n + 10, vector<int> (2 * m + 10, 0));
    h = n + 2, w = m + 2;
    a[h][w] = 1;
    for(auto c:s) {
        if(c == 'U') {
            h++;
        } else if(c == 'D') {
            h--;
        } else if(c == 'L') {
            w++;
        } else if(c == 'R') {
            w--;
        }
        a[h][w] = 1;
    }

    //求前缀和
    for(int i = 1; i <= 2 * n + 9; ++i) {
        for(int j = 1; j <= 2 * m + 9; ++j) {
            a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
        }
    }

    // for(int i = 1; i <= 2 * n + 9; ++i) {
    //     for(int j = 1; j <= 2 * m + 9; ++j) {
    //         cout << a[i][j] << " ";
    //     }
    //     cout << endl;
    // }


    ll ans = 0;
    for(int i = 1, h1, h2; i <= n; ++i) {
        for(int j = 1, w1, w2; j <= m; ++j) {
            h1 = (n + 2) - i + u, h2 = (n + 2) - i + d;
            w1 = (m + 2) - j + l, w2 = (m + 2) - j + r;
            if(A - (a[h2][w2] - a[h1 - 1][w2] - a[h2][w1 - 1] + a[h1 - 1][w1 - 1]) == k) {
                // cout << i << " " << j << endl;
                ans++;
            }
        }
    }
    cout << ans << endl;
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while(_--) solve();
    return 0;
}