#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

void rect_pref(vector<vector<ll>> &grid, ll top, ll bottom, ll left, ll right) {
	grid[bottom][left] = 1;
	grid[bottom][right + 1] = -1;
	grid[top + 1][left] = -1;
	grid[top + 1][right + 1] = 1;
}

void solve() {
	ll rows, cols, k;
	cin >> rows >> cols >> k;

	string s;
	cin >> s;

	ll TOP = rows, BOTTOM = 1, LEFT = 1, RIGHT = cols;
	ll top = rows, bottom = 1, left = 1, right = cols;
	for (char c : s) {
		if (c == 'U') {
			top--; bottom--;
		}
		else if (c == 'D') {
			top++;
			bottom++;
		}
		else if (c == 'L') {
			left++;
			right++;
		}
		else {
			left--;
			right--;
		}

		TOP = min(TOP, top);
		BOTTOM = max(BOTTOM, bottom);
		LEFT = max(LEFT, left);
		RIGHT = min(RIGHT, right);
	}

	// cout << TOP << " " << BOTTOM << " " << LEFT << " " << RIGHT << endl;

	if (TOP < BOTTOM || LEFT > RIGHT) {
		if (k == 0) {
			cout << rows * cols << endl;
			return;
		}
		cout << 0 << endl;
		return;
	}

	ll target = (TOP - BOTTOM + 1) * (RIGHT - LEFT + 1) - k;

	vector<vector<ll>> ps(rows + 2, vector<ll>(cols + 2));
	vector<vector<bool>> visited(rows + 2, vector<bool>(cols + 2));

	rect_pref(ps, TOP, BOTTOM, LEFT, RIGHT);
	visited[BOTTOM][LEFT] = true;

	for (char c : s) {
		ll v = 0, h = 0;
		if (c == 'U') v = 1;
		else if (c == 'D') v = -1;
		else if (c == 'L') h = -1;
		else h = 1;

		TOP += v; BOTTOM += v;
		LEFT += h; RIGHT += h;

		if (!visited[BOTTOM][LEFT]) {
			rect_pref(ps, TOP, BOTTOM, LEFT, RIGHT);
			visited[BOTTOM][LEFT] = true;
		}
	}

	for (ll i = 1; i <= rows; i++) {
		for (ll j = 1; j <= cols; j++) {
			ps[i][j] = ps[i][j-1] + ps[i][j];
		}
	}

	ll cnt = 0;
	for (ll j = 1; j <= cols; j++) {
		for (ll i = 1; i <= rows; i++) {
			ps[i][j] = ps[i-1][j] + ps[i][j];
			if (ps[i][j] == target) cnt++;
		}
	}
	cout << cnt << endl;
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	ll t;
	cin >> t;

	while (t--) solve();
}