#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define bug(X) cout << "bug:# " << X << endl
#define bug2(f, X) cout << "bug:# " << f << " " << X << endl
#define bug3(i, j, G) cout << "bug:# " << i << ' ' << j << ' ' << G << endl
// #define endl '\n'
using namespace std;
const int mod = 998244353;
const int N = 10 + 5e5;
void _();
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        _();
    return 0;
}

void _()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> pre(n + 2, vector<int>(m + 2));
    string s;
    cin >> s;
    int u = 1e18, d = 0, l = 1e18, r = 0;
    int x = 0, y = 0;
    for (auto v : s)
    {
        if (v == 'D')
            x++;
        if (v == 'U')
            x--;
        if (v == 'L')
            y--;
        if (v == 'R')
            y++;
        d = max(d, x);
        u = min(u, x);
        r = max(r, y);
        l = min(l, y);
    }
    r = m - r;
    d = n - d;
    u = 1 - u;
    l = 1 - l;
    // bug2(l, r);
    // bug2(u, d);
    int need = (d - u + 1) * (r - l + 1) - k;
    // bug(need);
    if ((l >= r) || (u >= d))
    {
        cout << (k == 0 ? n * m : 0) << endl;
        return;
    }
    int res = 0;
    map<pair<int, int>, int> has;
    int sx = u, sy = l;
    // bug2(sx, sy);
    auto add = [&](int x1, int y1)
    {
        int x2 = x1 + d - u;
        int y2 = y1 + r - l;
        // bug2(x2, y2);
        pre[x1][y1]++;
        pre[x1][y2 + 1]--;
        pre[x2 + 1][y1]--;
        pre[x2 + 1][y2 + 1]++;
    };
    has[{sx, sy}] = 1;
    add(sx, sy);
    for (auto v : s)
    {
        if (v == 'D')
            sx++;
        if (v == 'U')
            sx--;
        if (v == 'R')
            sy++;
        if (v == 'L')
            sy--;
        if (!has.count({sx, sy}))
            add(sx, sy); //, bug2(sx, sy);
        has[{sx, sy}] = 1;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            pre[i][j] += pre[i][j - 1] + pre[i - 1][j] - pre[i - 1][j - 1];
            if (pre[i][j] == need)
                res++;
        }
    // for (int i = 1; i <= n; i++)
    // {
    //     for (int j = 1; j <= m; j++)
    //         cout << pre[i][j] << ' ';
    //     cout << endl;
    // }
    cout << res << endl;
}