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

using namespace std;

inline int read () {
    int w = 1, s = 0; char ch = getchar ();
    for (; ! isdigit (ch); ch = getchar ()) if (ch == '-') w = -1;
    for (; isdigit (ch); ch = getchar ()) s = (s << 1) + (s << 3) + (ch ^ 48);
    return s * w;
}

void solve () {
	int n, m, k;
    cin >> n >> m >> k;

    string s;
    cin >> s;

    int u = 1, d = n, l = 1, r = m;
    int uu = 1, dd = n, ll = 1, rr = m;

    for (auto c : s) {
        if (c == 'U') {
            uu ++; dd ++;
        } else if (c == 'D') {
            uu --; dd --;
        } else if (c == 'L') {
            ll ++; rr ++;
        } else {
            ll --; rr --;
        }
        u = max (uu, u);
        d = min (d, dd);
        l = max (ll, l);
        r = min (rr, r);
    }    

    // cerr << u << " " << d << " " << l << " " << r << '\n';
    if (u > d || l > r) {
        if (k == 0) {
            cout << n * m << '\n';
        } else {
            cout << 0 << '\n';
        }
        return;
    }
    if (k > (d - u + 1) * (r - l + 1)) {
        cout << 0 << '\n';
        return;
    }


    vector pre (n * 2 + 10, vector <int> (m * 2 + 10));

    int x = n + 1, y = m + 1;
    pre[x][y] = 1;
    for (auto c : s) {
        if (c == 'U') {
            x --;
        } else if (c == 'D') {
            x ++;
        } else if (c == 'L') {
            y --;
        } else {
            y ++;
        }
        pre[x][y] = 1;
    }

    for (int i = 1; i <= 2 * n; i ++) {
        for (int j = 1; j <= 2 * m; j ++) {
            pre[i][j] += pre[i][j - 1];
        }
    }
    for (int i = 1; i <= 2 * n; i ++) {
        for (int j = 1; j <= 2 * m; j ++) {
            pre[i][j] += pre[i - 1][j];
        }
    }

    auto work = [&] (int x, int y) {
        int x1 = u + x, x2 = d + x;
        int y1 = l + y, y2 = r + y;
        return pre[x2][y2] - pre[x2][y1 - 1] - pre[x1 - 1][y2] + pre[x1 - 1][y1 - 1];
    };

    int ans = 0;
    for (int i = 1; i <= n; i ++) {
        for (int j = 1; j <= m; j ++) {
            x = n + 1 - i;
            y = m + 1 - j;
            int sum = work (x, y);
            if (sum == (d - u + 1) * (r - l + 1) - k) {
                ans ++;
            }
        }
    }

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

signed main () {
	ios::sync_with_stdio (false);
    cin.tie (nullptr);  
    
	int T = 1; 
	cin >> T;
	// T = read ();

	while (T --) {
		solve ();
	}
	
	return 0;
}