#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
void print() { cout << '\n'; }
template <typename T, typename...Args>
void print(T t, Args...args) { cout << t << ' '; print(args...); }
using ll = long long;
const int N = 200010;

int dir[4][2] = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1}
};

template <typename T> bool chmax(T &x, T y) { if (y > x) { x = y; return true; } return false; }
template <typename T> bool chmin(T &x, T y) { if (y < x) { x = y; return true; } return false; }

template <typename T = int>
vector<T> readVector(int n) {
    vector<T> a(n);
    for(T &x: a) cin >> x;
    return a;
} 

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

	string s;
	cin >> s;

	int x = 0, y = 0;
	int U = 0, D = 0, L = 0, R = 0;
	for (char c: s) {
		if (c == 'U') {
			x --;
		} else if (c == 'D') {
			x ++;
		} else if (c == 'L') {
			y --;
		} else {
			y ++;
		}
		if (x < 0) {
			chmax(U, -x);
		} else {
			chmax(D, x);
		}
		if (y < 0) {
			chmax(L, -y);
		} else {
			chmax(R, y);
		}
	}

	if (U + D >= n || L + R >= m) {
		cout << (!k ? n * m : 0) << '\n';
		return;
	}

	vector sum(2 * n + 1, vector<int>(2 * m + 1));
	x = n, y = m;
	sum[x][y] = 1;
	for (char c: s) {
		if (c == 'U') {
			x ++;
		} else if (c == 'D') {
			x --;
		} else if (c == 'L') {
			y ++;
		} else {
			y --;
		}
		sum[x][y] = 1;
	}
	for (int i = 1; i <= 2 * n; i ++) {
		for (int j = 1; j <= 2 * m; j ++) {
			sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
		}
	}

	int ans = 0;
	int t = (n - U - D) * (m - L - R);
	for (int i = 0; i < n; i ++) {
		for (int j = 0; j < m; j ++) {
			int cnt = t;
			int x1 = U + n - i;
			int x2 = n - 1 - D + n - i;
			int y1 = L + m - j;
			int y2 = m - 1 - R + m - j;
			cnt -= sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1];
			ans += cnt == k;
		}
	}
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1; 
	cin >> t;
	while(t --) {
	    solve();
	}

	return 0;
}