#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
const int sz = 1e3 + 5, mod = 1e9 + 7;
int arr[sz][sz], brr[sz][sz], vis[sz][sz];
int main() {
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	int t = 1; cin >> t;
	while(t--) {
		int n, m, k; cin >> n >> m >> k;
		int x = 0, y = 0;
		int mnx, mny, mxx, mxy;
		mnx = mny = mxx = mxy = 0;
		string c; cin >> c;
		for(char &cc:c) {
			if(cc == 'U') x--;
			if(cc == 'D') x++;
			if(cc == 'L') y--;
			if(cc == 'R') y++;
			mnx = min(mnx, x);
			mny = min(mny, y);
			mxx = max(mxx, x);
			mxy = max(mxy, y);
		}

		std::vector<int> ax = {mnx, mnx, mxx, mxx};
		std::vector<int> bx = {mny, mxy, mny, mxy};
		int mnx1, mny1, mxx1, mxy1;
		mnx1 = mny1 = n + m;
		mxx1 = mxy1 = 0;
		auto is_valid = [&](int i, int j) {
			for(int k = 0; k < 4; k++) {
				int x = i + ax[k];
				int y = j + bx[k];
				if(x < 1 || x > n || y < 1 || y > m) return 0;
			}
			return 1;
		};
		//continue;
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= m; j++) {
				if(is_valid(i, j)) {
					mnx1 = min(mnx1, i);
					mny1 = min(mny1, j);
					mxx1 = max(mxx1, i);
					mxy1 = max(mxy1, j);
				}
			}
		}
		//continue;
		if(mnx1 <= mxx1) {
			//cout << mxx1 << " " << mxy1 << endl;
			int x = mnx1, y = mny1;
			int lenx = mxx1 - mnx1 + 1;
			int leny = mxy1 - mny1 + 1;
			auto add = [&](int i, int j) {
				assert(i >= 0 && j >= 0);
				if(vis[i][j]) return;
				vis[i][j] = 1;
				arr[i][j]++;
				arr[i][j + leny]--;
				arr[i + lenx][j]--;
				arr[i + lenx][j + leny]++;
			};
			add(x, y);
			for(char &cc:c) {
				if(cc == 'U') x--;
				if(cc == 'D') x++;
				if(cc == 'L') y--;
				if(cc == 'R') y++;
				add(x, y);
			}
			int ans = 0;
			k = lenx * leny - k;
			//cout << k << "\n";
			for(int i = 1; i <= n + 1; i++) {
				for(int j = 1; j <= m + 1; j++) {
					arr[i][j] += arr[i - 1][j];
					
					brr[i][j] = brr[i][j - 1] + arr[i][j];
					//cout << brr[i][j] << " ";
					if(i <= n  && j <= m)
					ans += (brr[i][j] == k);
				} //cout << "\n";
			}
			for(int i = 1; i <= n + 1; i++) {
				for(int j = 1; j <= m + 1; j++) {
					arr[i][j] = brr[i][j] = vis[i][j] = 0;
				}
			}
			cout << ans << "\n";
		} else cout << (!k) * (n * m) << "\n";
	}
	return 0;
}