#include <bits/stdc++.h>


using namespace std;

#define mkp make_pair

const int N = 1e6 + 10;
int n, m, k;
using pii = pair<int, int>;

string s;

int cnt[1010][1010] = {0};

void solve(){
	set<pii> path;

	cin >> n >> m >> k;
	int l = 1, r = m, u = 1, d = n;
	int maxu = u, mind = d, maxl = l, minr = r;
	cin >> s;
	int len = s.size();
	for (int i = 0; i < len; i ++){
		if (s[i] == 'U'){
			u ++;
			maxu = max(u, maxu);
			d ++;
		}else if (s[i] == 'D'){
			d --;
			mind = min(mind, d);
			u --;
		}else if (s[i] == 'L'){
			l ++;
			maxl = max(maxl, l);
			r ++;
		}else{
			r --;
			minr = min(minr, r);
			l --;
		}
	}
	int sum = (mind - maxu + 1) * (minr - maxl + 1);
	if ((mind - maxu + 1) <= 0 || (minr - maxl + 1) <= 0) sum = 0;
	if (sum <= 0){
		if (k == 0){
			cout << n * m << endl;
			return ;
		}else{
			cout << 0 << endl;
			return ;
		}
	}
	
	
	
	
	int sx = maxu, sy = maxl;
	path.insert(make_pair(sx, sy));
	for (int i = 0; i < len; i ++){
		if (s[i] == 'U') sx --;
		else if (s[i] == 'D') sx ++;
		else if (s[i] == 'L') sy --;
		else sy ++;
		path.insert(make_pair(sx, sy));
	}
	
	map<pair<int, int>, int> mp;
	
	for (auto [x, y] : path){
		mp[mkp(x, y)] ++;
	}
	
	for (int i = maxl + 1; i <= minr; i ++){
		for (auto [x, y] : path){
			mp[mkp(x, y + (i - maxl))] ++;
		}
		
	}
	
	for (int i = maxu; i <= mind; i ++){
		for (auto [pos, dis] : mp){
			cnt[pos.first + (i - maxu)][pos.second] += dis; 
		}
	}
	
	
	if (sum < 0){
		sum = 0;
	}
	cout << sum << endl;
	
	sum -= k;
	int ans = 0;
	
	for (int i = 1; i <= n; i ++){
		for (int j = 1; j <= m; j ++){
			if (cnt[i][j] == sum){
				ans ++;
//				cout << i << ' ' << j << endl;
						
			}
//			cout << cnt[i][j] << " \n"[j == m];
			
			cnt[i][j] = 0;
		}
	}
	
	
	
	cout << ans << endl;
	
	
	
	
}


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