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

void solve() {
	int n, m, k;
	string s;
	cin >> n >> m >> k >> s;
	int len = s.size();
	int mnx = n, mny = m;
	int mxx = 1, mxy = 1;
	int x = 0, y = 0;
	for (int i = 0; i < len; i++) {
		if (s[i] == 'L') --y;
		if (s[i] == 'R') ++y;
		if (s[i] == 'U') --x;
		if (s[i] == 'D') ++x;
		mnx = min(mnx, n-x);
		mxx = max(mxx, 1-x);
		mny = min(mny, m-y);
		mxy = max(mxy, 1-y);
	}
	cerr<<mxx<<' '<<mnx<<' '<<mxy<<' '<<mny<<endl;
	if (mnx >= mxx && mny >= mxy) {
		int all = (mny - mxy + 1) * (mnx - mxx + 1);
		int ans = 0;
		vector<vector<int>> a(n + 3, vector<int>(m + 3, 0));
		auto add = [&](int x0, int y0) {
			int sx = mxx + x0;
			int sy = mxy + y0;
			int ex = mnx + x0;
			int ey = mny + y0;
			sx = max(sx, 1); sx = min(sx, n);
			sy = max(sy, 1); sy = min(sy, m);
			ex = max(ex, 1); ex = min(ex, n);
			ey = max(ey, 1); ey = min(ey, m);
			if (sx<=ex&&sy<=ey) {
				a[sx][sy] += 1;
				a[sx][ey + 1] -= 1;
				a[ex + 1][sy] -= 1;
				a[ex + 1][ey + 1] += 1;
			}
		};
		int x = 0, y = 0;
		vector<pair<int, int>> b;
		for (int i = 0; i < len; i++) {
			if (s[i] == 'L') --y;
			if (s[i] == 'R') ++y;
			if (s[i] == 'U') --x;
			if (s[i] == 'D') ++x;
			if (x||y) b.emplace_back(x, y);
		}
		sort(b.begin(), b.end());
		b.resize(unique(b.begin(), b.end()) - b.begin());
		for (auto [x, y] : b) {
			add(x, y);
		}
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				a[i][j] += a[i - 1][j];
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				a[i][j] += a[i][j - 1];
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				int ned = all - k;
				if (i>=mxx&&i<=mnx&&j>=mxy&&j<=mny) ned--;
				int now = a[i][j];
				if (now == ned) {
					cerr << "ok: " << i << " " << j << endl;
					ans += 1;
				}
			}
		}
		cout << ans << "\n";
	} else {
		if (k == 0) {
			cout << n * m << "\n";
		} else {
			cout << 0 << "\n";
		}
	}
}

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