#include <bits/stdc++.h>
#define LL long long
typedef long long ll;
using namespace std;

int a[2005][2005];

void solve()
{
    int n, m, k;
    string s;
    cin >> n >> m >> k >> s;

    int x = 0, y = 0, l = 0, r = 0, u = 0, d = 0;
    for (int i = 0; i < s.length(); i++)
    {
        if (s[i] == 'U')
            x--;
        else if (s[i] == 'D')
            x++;
        else if (s[i] == 'L')
            y--;
        else if (s[i] == 'R')
            y++;

        l = min(l, y);
        r = max(r, y);
        u = min(u, x);
        d = max(d, x);
    }

    int n1 = max(n - abs(u) - abs(d), 0), m1 = max(m - abs(l) - abs(r), 0);
    x = n, y = m;

    for (int i = 0; i <= (n << 1); i++)
        for (int j = 0; j <= (m << 1); j++)
            a[i][j] = 0;
    a[x][y] = 1;
    for (int i = 0; i < s.length(); i++)
    {
        if (s[i] == 'U')
            x++;
        else if (s[i] == 'D')
            x--;
        else if (s[i] == 'L')
            y++;
        else if (s[i] == 'R')
            y--;

        if (x > 0 && x <= (n << 1) && y > 0 && y <= (m << 1))
            a[x][y] = 1;
    }
    for (int i = 1; i <= (n << 1); i++)
        for (int j = 1; j <= (m << 1); j++)
            a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
    int ans = 0;
    for (int i = abs(u), i1 = 1; i1 <= n; i1++, i++)
        for (int j = abs(l), j1 = 1; j1 <= m; j1++, j++)
        {
            x = i + n1, y = j + m1;
            if (max(n1 * m1 - (a[x][y] - a[i][y] - a[x][j] + a[i][j]), 0) == k)
                ans++;
        }

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

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

    int tt = 1;
    cin >> tt;
    while (tt--)
        solve();
}