#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int N = 1011;
const int Mod = 998244353;
using ll = long long;

ll max(ll a, ll b) { return a > b ? a : b; }

ll n, m, k, a[N][N], q, qzh[N][N], len, sum, Lc, Lr;
ll xx, x, yy, y, lx, ly;
ll rn, cn, rmax, rmin, cmax, cmin;
string S;

void solve()
{
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            a[i][j] = 0;
    cin >> S;
    len = S.size();
    rmax = rmin = cmax = cmin = rn = cn = 0;
    for (int i = 0; i < len; i++)
    {
        if (S[i] == 'U')
        {
            rn--;
            if (rn < rmin)
                rmin = rn;
        }
        if (S[i] == 'D')
        {
            rn++;
            if (rn > rmax)
                rmax = rn;
        }
        if (S[i] == 'L')
        {
            cn--;
            if (cn < cmin)
                cmin = cn;
        }
        if (S[i] == 'R')
        {
            cn++;
            if (cn > cmax)
                cmax = cn;
        }
    }
    xx = 1 - rmin;
    yy = 1 - cmin;
    lx = n + rmin - rmax;
    ly = m + cmin - cmax;
    // cout << xx << ' ' << yy << ' ' << lx << ' ' << ly << '\n';
    if (lx <= 0 || ly <= 0)
    {
        if (k > 0)
            cout << "0\n";
        else
            cout << n * m << '\n';
        return;
    }
    k = lx * ly - k;
    if (k < 0)
    {
        cout << "0\n";
        return;
    }
    x = xx;
    y = yy;
    a[x][y] = 1;
    for (int i = 0; i < len; i++)
    {
        if (S[i] == 'U')
            x--;
        if (S[i] == 'D')
            x++;
        if (S[i] == 'L')
            y--;
        if (S[i] == 'R')
            y++;
        a[x][y] = 1;
    }
    for (int i = 1; i <= n; i++)
    {
        q = 0;
        for (int j = 1; j <= m; j++)
        {
            q += a[i][j];
            qzh[i][j] = qzh[i - 1][j] + q;
        }
    }
    sum = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) // (i-lx+1,j-ly+1)(i,j)
        {
            Lr = max(0, i - lx);
            Lc = max(0, j - ly);
            if ((qzh[i][j] - qzh[Lr][j] - qzh[i][Lc] + qzh[Lr][Lc]) == k)
            {
                // cout << i << ' ' << j << '\n';
                sum++;
            }
        }
    cout << sum << '\n';
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}