#include <bits/stdc++.h>
#define int long long

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

const int inf = 1e18, mod = 1e9 + 7;

void solve()
{
    int n, m, k;
	cin >> n >> m >> k;
    string s;
    cin >> s;
    int x = 0, y = 0; 
    int up = 0, down = 0, left = 0, right = 0;
    for (auto c : s)
    {
        if (c == 'U') 
        {
            y -- ;
            down = max(down, -y);
        }
        else if (c == 'D')
        {
            y ++ ;
            up = max(up, y);
        }
        else if (c == 'L') 
        {
            x ++ ;
            right = max(right, x);
        }
        else
        {
            x -- ;
            left = max(left, -x);
        }
    }
    if (up + down >= n || left + right >= m)
    {
        if (k == 0) cout << n * m << '\n';
        else cout << 0 << '\n';
        return;
    }
    if ((n - up - down) * (m - left - right) <= k)
    {
        cout << 0 << '\n';
        return;
    }
    
    vector<vector<int>> a(n*4+11, vector<int>(m*4+11));
    x = 2*n+5, y = 2*m+5;
    a[x][y] = 1;
    for (auto c : s)
    {
        if (c == 'U') x -- ;
        else if (c == 'D') x ++ ;
        else if (c == 'R') y ++ ;
        else y -- ;
        a[x][y] = 1;
    }
    for (int i = 1; i <= n*4+10; i ++ )
    {
        for (int j = 1; j <= m*4+10; j ++ )
        {
            a[i][j] += a[i-1][j] + a[i][j-1] - a[i-1][j-1];
            // cout  << a[i][j] << ' ';
        }
        // cout << '\n';
    }

    x = n - (up + down), y = m - (left + right);
    // cout << x << endl;
    // cout << y << endl;
    int ans = 0;
    for (int i = 1; i + x - 1 <= n*4+10; i ++ )
    {
        for (int j = 1; j + y - 1 <= m*4+10; j ++ )
        {
			if (a[i+x-1][j+y-1] - a[i+x-1][j-1] - a[i-1][j+y-1] + a[i-1][j-1] == k) 
			{
				ans ++ ;
				// cout <<  i << ' ' << j << '\n';
			}
        }
    }
    cout << ans << '\n';
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int T;
	cin >> T;
	while (T -- )
	{
		solve();
	}
	return 0;
}