#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
int walk[4][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};
map<char, int> mp;

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    string s;
    cin >> s;
    int r = s.size();

    int dx = 0, dy = 0, mxl = 0, mxr = 0, mxd = 0, mxu = 0;
    for (int i = 0; i < r; ++i)
    {
        int j = mp[s[i]];
        dx += walk[j][0];
        dy += walk[j][1];
        mxl = min(mxl, dy);
        mxr = max(mxr, dy);
        mxd = min(mxd, dx);
        mxu = max(mxu, dx);
    }

    int xl = 1 + mxu, yl = 1 + mxr, xr = n + mxd, yr = m + mxl;
    if (xl > xr || yl > yr)
    {
        if (k == 0)
            cout << n * m << '\n';
        else
            cout << 0 << '\n';
        return;
    }
    vector<vector<int>> vis(n + 1, vector<int>(m + 1));
    int sx = xl, sy = yl;
    vis[sx][sy] = 1;
    dx = xr - xl + 1, dy = yr - yl + 1;
    int res = dx * dy;
    // cerr << sx << ' ' << sy << "\n";
    // cerr << sx << ' ' << sy << ' ' << sx + dx - 1 << ' ' << sx + dy - 1 << "\n";
    for (int i = 0; i < r; ++i)
    {
        int j = mp[s[i]];
        sx += walk[j][0];
        sy += walk[j][1];
        vis[sx][sy] = 1;
        // cerr << sx << ' ' << sy << "\n";
    }

    vector<vector<int>> a(n + 1, vector<int>(m + 1));
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
        {
            if (!vis[i][j])
                continue;
            a[i + dx - 1][i + dy - 1]++;
            a[i + dx - 1][j - 1]--;
            a[i - 1][j + dy - 1]--;
            a[i - 1][j - 1]++;
        }

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];

    int ans = 0;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            ans += (a[i][j] == res - k);

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

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    mp['R'] = 0, mp['U'] = 1, mp['L'] = 2, mp['D'] = 3;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}