#include <bits/stdc++.h>

using LL = long long;

int T, n, m, k;
std::string str;

const int maxN = 1e3 + 10;
std::unordered_set<int> s;
int b[maxN][maxN];

void modify(int lx, int ly, int rx, int ry) {
	b[rx + 1][ry + 1] += 1;
	b[lx][ly] += 1;
	b[rx + 1][ly] -= 1;
	b[lx][ry + 1] -= 1;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	
	std::cin >> T;
	while(T--) {
		std::cin >> n >> m >> k >> str;
		
		int min_x = 0, min_y = 0, max_x = 0, max_y = 0;
		int cx = 0, cy = 0; 
		for(auto c : str) {
			if(c == 'U') cx--;
			if(c == 'D') cx++;
			if(c == 'L') cy--;
			if(c == 'R') cy++;
			
			min_x = std::min(min_x, cx);
			min_y = std::min(min_y, cy);
			max_x = std::max(max_x, cx);
			max_y = std::max(max_y, cy);
		}
		
		int lf_x = 1 + max_x, lf_y = 1 + max_y, 
			rg_x = n + min_x, rg_y = m + min_y;
		if(lf_x > rg_x || lf_y > rg_y || max_x >= n || min_x <= -n || max_y >= m || min_y <= -m) {
			std::cout << (k == 0 ? n * m : 0) << "\n";
			continue;
		}
		
		for(int i = 1; i <= n + 1; i++) {
			for(int j = 1; j <= m + 1; j++) b[i][j] = 0;
		}
		
		int x = lf_x, y = lf_y, rx = rg_x, ry = rg_y;
		modify(lf_x, lf_y, rg_x, rg_y);
		
		s.clear();
		s.insert(lf_x * m + lf_y);
		
		for(auto c : str) {
			if(c == 'U') x--, rx--;
			if(c == 'D') x++, rx++;
			if(c == 'L') y--, ry--;
			if(c == 'R') y++, ry++;
			
			if(s.count(x * m + y) == 0) {
				modify(x, y, rx, ry);
				s.insert(x * m + y);
			}
		}
		
		int ans = 0;
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= m; j++) {
				b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
			}
		}
		
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= m; j++) {
				ans += (k == (rg_x - lf_x + 1) * (rg_y - lf_y + 1) - b[i][j]);
			}
		}
		
		std::cout << ans << "\n";
	}	 
	return 0;
}