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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 1 << 10;
int a[N][N], u[N][N];

void move(int& x, int& y, char ch){
	x += ch == 'D';
	x -= ch == 'U';

	y += ch == 'R';
	y -= ch == 'L';	
}


void solve(){
	int n, m, k;
	cin >> n >> m >> k;
	string s;
	cin >> s;
	
	int mny = 0, mxy = 0;
	int mnx = 0, mxx = 0;

	int x = 0, y = 0;
	FOR(i, 0, SZ(s)){
		move(x, y, s[i]);
		
		mnx = min(mnx, x);
		mxx = max(mxx, x);

		mny = min(mny, y);
		mxy = max(mxy, y);
	}
	int n1 = n;
	n1 -= -mnx;
	n1 -= mxx;
	n1 = max(0, n1);

	int m1 = m;
	m1 -= -mny;
	m1 -= mxy;
	m1 = max(0, m1);
	
	if(n1 == 0 || m1 == 0){
		if(k == 0)
			cout << n * m << "\n";
		else
			cout << "0\n";
		return;
	}
	
	
	
	FOR(i, 0, n)
		FOR(j, 0, m){
			a[i][j] = 0;
			u[i][j] = 0;
		}
	
	
	x = -mnx, y = -mny;
	
	FOR(i, 0, SZ(s) + 1){
		assert(0 <= x && x + n1 <= n);
		assert(0 <= y && y + m1 <= m);
		
		if(u[x][y] == 0){
			a[x][y]++;
			a[x + n1][y + m1]++;
			
			a[x + n1][y]--;
			a[x][y + m1]--;
		}
		u[x][y] = 1;
		
		if(i != SZ(s))
			move(x, y, s[i]);
	}
	
	
	FOR(i, 0, n)
		FOR(j, 1, m)
			a[i][j] += a[i][j - 1];
	FOR(i, 1, n)
		FOR(j, 0, m)
			a[i][j] += a[i - 1][j];
		
	k = n1 * m1 - k;
	int ans = 0;
	FOR(i, 0, n){
		FOR(j, 0, m){
			ans += a[i][j] == k;
		}
	}
	
	
	cout << ans << endl;
	
	
}


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