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

int mp[2005][2005];
int n,m,k;


int maxu,maxd;
int maxl,maxr;

int sum[2005][2005];

void solve()
{



    for(int i = 0;i<=2004;i++)
    {
        for(int j = 0;j<=2004;j++)
        {
            mp[i][j] = 1;
        }
    }

    maxu= 0;maxd=0;
    maxl= 0;maxr=0;
    cin >> n >> m >> k;
    char s[1000005];
    cin >> s;
    int len = strlen(s);


    int tempup = 0;
    int templr = 0;
    for(int i = 0;i<len;i++)
    {
        if(s[i]=='U')
        {
            tempup ++;
            maxu = max(maxu,tempup);
            maxd = min(maxd,tempup);
        }
        if(s[i]=='D')
        {
            tempup --;
            maxu = max(maxu,tempup);
            maxd = min(maxd,tempup);
        }
        if(s[i]=='L')
        {
            templr --;
            maxl = min(templr,maxl);
            maxr = max(templr,maxd);
        }
        if(s[i]=='R')
        {
            templr --;
            maxl = min(templr,maxl);
            maxr = max(templr,maxd);
        }
    }

//maxl,maxr,maxd,maxu;

int wide ;int high;

wide = m - maxr - abs(maxl);
high = n - maxu - abs(maxd);
    if(wide <=0||high <=0)
    {
        if(k == 0)
            {
                cout << n * m <<'\n';
                return;
            }
    }



//cout << high  <<' ' <<wide<< '\n';

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

        mp[x][y] = 0;
    }

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

    for(int i = 1;i<=m ;i++)
    {
        for(int j = 1;j<=n;j++)
        {
            int temp =0;
            /*cout << sum[i + wide + abs(maxl)-1][j+high + abs(maxu) -1]<<' '
            << sum[i + abs(maxl) - 1][j+high + abs(maxu) -1] <<' '<< sum[j + abs(maxu)-1][i + wide + abs(maxl)-1] <<' '<< sum[i + abs(maxl) - 1][j + abs(maxu)-1] <<'\n';*/
            temp = sum[i + wide + abs(maxl)-1][j+high + abs(maxu) -1] -sum[i + abs(maxl) - 1][j+high + abs(maxu) -1] - sum[j + abs(maxu)-1][i + wide + abs(maxl)-1] + sum[i + abs(maxl) - 1][j + abs(maxu)-1];
            if(temp == k)
            {
                ans ++;
            }
            //cout << temp << '\n';
        }
    }


    cout << ans << '\n';




}

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

    return 0;
}