#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 2e5 + 10, M = 5010, MOD = 1e9 + 7;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m, k, c, d;

void solve()
{
    cin >> n >> m >> k;
    string s;
    cin >> s;
    vector<vector<int>> dp(n * 2, vector<int>(m * 2));
    int x = n, y = m;
    dp[n][m] = 1;
    int up = 1, down = n, l = 1, r = m;
    int x1 = 1, x2 = n, y1 = 1, y2 = m;
    for(auto t : s)
    {
        if(t == 'U') x ++, down --, up --;
        else if(t == 'D') x --, up ++, down ++;
        else if(t == 'L') y ++, r --, l --;
        else y --, l ++, r ++;
        x1 = max(x1, up), x2 = min(x2, down), y1 = max(y1, l), y2 = min(y2, r);
        if(x < n * 2 && x >= 1 && y < m * 2 && y >= 1) dp[x][y] = 1;
    }

    if(x1 > x2 || y1 > y2)
    {
        if(k == 0) cout << n * m << endl;
        else cout << 0 << endl;
        return;
    }

    // for(int i = 1; i < n * 2; i ++)
    //     for(int j = 1; j < m * 2; j ++)
    //     {
    //         cout << dp[i][j] << " ";
    //         if(j == m * 2 - 1) cout << endl;
    //     }

    int d1 = x2 - x1 + 1, d2 = y2 - y1 + 1;
    int sum = d1 * d2;
    for(int i = 1; i < n * 2; i ++)
        for(int j = 1; j < m * 2; j ++)
        {
            dp[i][j] += dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1];
            // cout << dp[i][j] << " ";
            // if(j == m * 2 - 1) cout << endl;
        }

    LL ans = 0;
    for(int i = x1; i < n + x1; i ++)
        for(int j = y1; j < n + y1; j ++)
        {
            if(i + d1 - 1 < 2 * n && j + d2 - 1 < 2 * m)
            {
                int p1 = i + d1 - 1, p2 = j + d2 - 1;
                if(sum - (dp[p1][p2] - dp[p1][j - 1] - dp[i - 1][p2] + dp[i - 1][j - 1]) == k) 
                {
                    ans ++;
                }
            }
        }
    cout << ans << endl;
}


int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}