#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
const int N = 1e6;
const int M = 1e3 + 10;
void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(5, 0);
    vector<int> b(5, 0);
    vector<vector<int>> mp(n + 100, vector<int>(m + 100, 0));
    vector<vector<int>> sum(n + 100, vector<int>(m + 100, 0));
    string s;
    cin >> s;
    int l = s.size();
    s = " " + s;
    for (int i = 1; i <= l; i++)
    {
        if (s[i] == 'U')
        {
            if (b[2] == 0)
                a[1]++;
            else
            {
                b[2]--;
            }
            b[1]++;
        }
        else if (s[i] == 'D')
        {
            if (b[1] == 0)
                a[2]++;
            else
            {
                b[1]--;
            }
            b[2]++;
        }
        else if (s[i] == 'L')
        {
            if (b[4] == 0)
                a[3]++;
            else
            {
                b[4]--;
            }
            b[3]++;
        }
        else
        {
            if (b[3] == 0)
                a[4]++;
            else
            {
                b[3]--;
            }
            b[4]++;
        }
    }
    int x1 = 0, x2 = 0, y1 = 0, y2 = 0;
    x1 = a[1] + 1;
    y1 = a[3] + 1;
    x2 = n - a[2];
    y2 = m - a[4];
    if (x1 > x2 || y1 > y2)
    {
        if (k > 0)
        {
            cout << 0 << endl;
            return;
        }

        cout << n * m << endl;
        return;
    }
    if (x1 > n || y1 > m || x2 < 1 || y2 < 1)
    {
        if (k > 0)
        {
            cout << 0 << endl;
            return;
        }

        cout << n * m << endl;
        return;
    }
    x1 = max(a[1] + 1, 1ll);
    y1 = max(1ll, a[3] + 1);
    x2 = min(n, n - a[3]);
    y2 = min(m, m - a[4]);
    for (int i = x1; i <= x2; ++i)
        for (int j = y1; j <= y2; ++j)
            mp[i][j] = 1;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            sum[i][j] = mp[i][j] - mp[i - 1][j] - mp[i][j - 1] + mp[i - 1][j - 1];
    int ss = (x2 - x1 + 1) * (y2 - y1 + 1);
    if (k > ss)
    {
        cout << 0 << endl;
        return;
    }
    for (int i = 1; i <= l; i++)
    {
        if (s[i] == 'U')
        {
            x1 -= 1;
            x2 -= 1;
        }
        else if (s[i] == 'D')
        {
            x1 += 1;
            x2 += 1;
        }
        else if (s[i] == 'L')
        {
            y1 -= 1;
            y2 -= 1;
        }
        else
        {
            y1 += 1;
            y2 += 1;
        }
        sum[x1][y1] += 1;
        sum[x2 + 1][y2 + 1] += 1;
        sum[x1][y2 + 1] -= 1;
        sum[x2 + 1][y1] -= 1;
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            sum[i][j] = sum[i][j] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
            if (sum[i][j] == ss - k)
            {
                ans++;
            }
        }
    }
    cout << ans << endl;
    return;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}