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

int n, m, k;
int mp[2005][2005];
int sum[2005][2005];
void solve()
{
    cin >> n >> m >> k;
    char s[1000006];
    cin >> s ;
    int len  = strlen(s);
//    cout << s << '\n';
    int l,r,u,d;
    l = r = u = d = 0;
    int maxl,maxr,maxu,maxd;
    maxl = maxr = maxu = maxd = 0;
    for(int i = 0;i<len;i++)
    {
        if(s[i] == 'L')
        {
            l ++;
            r --;
        }
        if(s[i] == 'R')
        {
            r ++;
            l--;
        }
        if(s[i] == 'U')
        {
            u ++;
            d --;
        }
        if(s[i]=='D')
        {
            u --;
            d++;
        }

        maxu = max(u, maxu);maxd = max(d, maxd);maxl = max(l, maxl);maxr = max(r, maxr);
    }
    //  cout << "l:" << maxl << " r:" << maxr << " u:" << maxu << " d:" << maxd << '\n';



    int high = n - maxu - maxd;
    int width = m - maxl - maxr;
    // cout << "high:" <<high << ' ' << " width:" << width << '\n';
    // init()
    for (int i = 1; i <= 2*n;i++)
    {
        for (int j = 1; j <= 2 * m;j++)
        {
            mp[i][j] = 1;
            sum[i][j] = 0;
        }
    }
    if(high<=0||width<=0)
    {
        if(k == 0)
        {
            cout << n * m <<'\n';
            return;
        }
    }

    int x = n, y = m;
    mp[x][y] = 0;
    for (int i = 0; i < len;i++)
    {
        if(s[i] == 'L')
        {
            y++;
        }
        if(s[i] == 'R')
        {
            y--;
        }
        if(s[i] == 'U')
        {
            x++;
        }
        if(s[i]=='D')
        {
            x--;
        }
        mp[x][y] = 0;
    }

    // for (int i = 1; i <= 2*n;i++)
    // {
    //     for (int j = 1; j <= 2 * m;j++)
    //     {
    //         cout << mp[i][j] <<' ';
    //     }
    //     cout << '\n';
    // }
    for (int i = 1; i <= 2*n;i++)
    {
        for (int j = 1; j <= 2 * m;j++)
        {
            sum[i][j] = sum[i][j-1] + sum[i-1][j]-sum[i-1][j-1]+mp[i][j];
        //    cout << sum[i][j] << ' ';
        }
        //cout << '\n';
    }


    int ans = 0;
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<=m;j++)
        {
            int temp = 0;
            int x1 = i + maxu - 1;
            int y1 = j + maxl - 1;
            int x2 = i + maxu - 1 + high;
            int y2 = j + maxl - 1 + width;
            //cout << x1 << ' ' << y1 <<' '<< x2 << ' ' << y2 << '\n';

            temp = sum[x2][y2] + sum[x1][y1] - sum[x1][y2] - sum[x2][y1];
            if (temp == k)
            {
                ans++;
            }
        }
    }

    cout << ans << '\n';
}

int main()
{
    int _;
    cin >>_;
    while (_--)
    {
        solve();
    }
    

    return 0;
}