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

#define int long long  

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

	string s;
	cin >> s;

	int tx = 0, ty = 0;
	int l = 1, r = m, u = 1, d = n;
	for (auto c : s) {
		if (c == 'U') {
			tx--;
		} else if (c == 'D') {
			tx++;
		} else if (c == 'L') {
			ty--;
		} else {
			ty++;
		}
		l = max(l, 1 - ty);
		r = min(r, m - ty);
		u = max(u, 1 - tx);
		d = min(d, n - tx);
	}

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

	vector a(2 * n + 1, vector<int>(2 * m + 1));
	tx = n, ty = m;
	a[tx][ty] = 1;
	for (auto c : s) {
		if (c == 'D') {
			tx--;
		} else if (c == 'U') {
			tx++;
		} else if (c == 'R') {
			ty--;
		} else {
			ty++;
		}
		a[tx][ty] = 1;
	}

	// for (int i = 0; i <= 2 * n; i++) {
	// 	for (int j = 0; j <= 2 * m; j++) {
	// 		cout << a[i][j] << " \n"[j == 2 * m];
	// 	}
	// }

	// cout << "\n";

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

	// for (int i = 0; i <= 2 * n; i++) {
	// 	for (int j = 0; j <= 2 * m; j++) {
	// 		cout << a[i][j] << " \n"[j == 2 * m];
	// 	}
	// }

	auto query = [&](int l1, int r1, int l2, int r2) {
		// cerr << l1 << " " << r1 << " " << l2 << " " << r2 << "\n";
		// cerr << a[r1][r2] << " " << a[l1 - 1][r2] << " " << a[r1][l2 - 1] << " " << a[l1 - 1][l2 - 1] << "\n";
		// cerr << a[r1][r2] - a[l1 - 1][r2] - a[r1][l2 - 1] + a[l1 - 1][l2 - 1] << "\n";
		return a[r1][r2] - a[l1 - 1][r2] - a[r1][l2 - 1] + a[l1 - 1][l2 - 1];
	};

	// cerr << query(u - 3 + n, d - 3 + n, l - 4 + m, r - 4 + m) << "\n";

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

	cout << ans << "\n";
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}