#include <bits/stdc++.h>

using i64 = long long;

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

	std::string s;
	std::cin >> s;

	int x1 = 1, y1 = 1, x2 = n, y2 = m;
	int flag = 0;
	int x = 0, y = 0;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == 'U') {
			x1--, x2--;
			x--;
		} else if (s[i] == 'D') {
			x1++, x2++;
			x++;
		} else if (s[i] == 'L') {
			y1--, y2--;
			y--;
		} else if (s[i] == 'R') {
			y1++, y2++;
			y++;
		}
		if (x1 > n || x2 < 1 || y1 > m || y2 < 1) {
			flag = 1;
			break;
		}
		x1 = std::min(std::max(1, x1), n);
		x2 = std::min(std::max(1, x2), n);
		y1 = std::min(std::max(1, y1), m);
		y2 = std::min(std::max(1, y2), m);
	}

	x1 -= x;
	x2 -= x;
	y1 -= y;
	y2 -= y;
	// std::cout << x1 << " " << y1 << "\n";
	// std::cout << x2 << " " << y2 << "\n";

	if (flag) {
		if (k == 0) {
			std::cout << n * m << "\n";
		} else {
			std::cout << 0 << "\n";
		}
	} else {
		int ans = 0;
		int sum = (x2 - x1 + 1) * (y2 - y1 + 1) - k;
		std::vector dif(n + 2, std::vector<int>(m + 2, 0));
		std::set<std::pair<int, int>> st;
		st.insert({x1, y1});
		dif[x1][y1] += 1; dif[x2 + 1][y1] -= 1;
		dif[x1][y2 + 1] -= 1; dif[x2 + 1][y2 + 1] += 1;
		for (int i = 0; i < s.size(); i++) {
			if (s[i] == 'U') {
				x1--, x2--;
				x--;
			} else if (s[i] == 'D') {
				x1++, x2++;
				x++;
			} else if (s[i] == 'L') {
				y1--, y2--;
				y--;
			} else if (s[i] == 'R') {
				y1++, y2++;
				y++;
			}
			if (!st.count({x1, y1})) {
				st.insert({x1, y1});
				dif[x1][y1] += 1; dif[x2 + 1][y1] -= 1;
				dif[x1][y2 + 1] -= 1; dif[x2 + 1][y2 + 1] += 1;
			}
		}
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				dif[i][j] += dif[i - 1][j] + dif[i][j - 1] - dif[i - 1][j - 1];
				if (dif[i][j] == sum) {
					ans++;
				}
			}
		}
		std::cout << ans << "\n";
	}
}

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

	int t;
	std::cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}