#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
const int N = 2005;
int n, m, k;
string s;
int xl, xr, yl, yr;

vector<pair<int, int> > nums;

int mp[N][N];

void solve() {
    cin >> n >> m >> k;
    for (int i = 0; i <= 2*n; i++) {
        for (int j = 0; j <= 2*m; j++) {
            mp[i][j] = 0;
        }
    }
    cin >> s;
    xl = 1, xr = n, yl = 1, yr = m;
    int nxl = 1, nxr = n, nyl = 1, nyr = m;
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == 'R') {
            nyl++, nyr++;
            if (nyl > m) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nyr > m) {
                nyr = m;
                yr--;
            }
        }
        else if (s[i] == 'L') {
            nyl--, nyr--;
            if (nyr < 1) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nyl < 1) {
                nyl = 1;
                yl++;
            }
        }
        else if (s[i] == 'U') {
            nxl--, nxr--;
            if (nxr < 1) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nxl < 1) {
                nxl = 1;
                xl++;
            }
        }
        else if (s[i] == 'D') {
            nxl++, nxr++;
            if (nxl > n) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nxr > n) {
                nxr = n;
                xr--;
            }
        }
    }
    int sum = (yr - yl + 1) * (xr - xl + 1);
    int x = n+1, y = m+1;
    mp[x][y]=1;
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == 'U') {
            x++;
        }
        else if (s[i] == 'D') {
            x--;
        }
        else if (s[i] == 'L') {
            y++;
        }
        else if (s[i] == 'R') {
            y--;
        }
        if(x>=2&&x<=2*n&&y>=2&&y<=2*m)
        	mp[x][y]=1;
    }

//	cout<<xl<<" "<<xr<<" "<<yl<<" "<<yr<<endl;
  /*  
  	int mix = 1e18, miy = 1e18;
    for (auto p = nums.begin(); p != nums.end(); p++) {
        mix = min(mix, p->first);
        miy = min(miy, p->second);
    }
    mix--; miy--;
    mix = -mix, miy = -miy;
    for (auto p = nums.begin(); p != nums.end(); p++) {
        mp[p->first + mix+n][p->second + miy+m] = 1;
    }
	*/
    for (int i = 1; i <= 2*n ; i++) {
        for (int j = 1; j <= 2*m ; j++) {
             mp[i][j] = mp[i][j] + mp[i - 1][j] + mp[i][j - 1] - mp[i - 1][j - 1];
            // cout<<mp[i][j]<<' ';
        }//cout<<endl;
    }
	//cout<<sum<<endl;
    int ans = 0;
    //枚举起点，1,1一直到n,m;
    for (int i = 2; i <= n+1; i++) {

        for (int j = 2; j <= m+1; j++) {
    
        	//放右上角
          //  int xx = i, yy = j;
           // int x = i - (xr - xl), y = j - (yr - yl);
          //  x = max(1ll, x); y = max(1ll, y);
            //if ((mp[xx][yy] + mp[x - 1][y - 1] - mp[x - 1][yy] - mp[xx][y - 1]) == sum - k)ans++;
            
			
			//放左上角
			
            int x=i+xl-1,y=j+yl-1;
           	int xx=i+xr-1,yy=j+yr-1;
           	/*int f=1;
			if(n+1>=x&&n+1<=xx&&m+1>=y&&m+1<=yy) f=0;*/
	
			if ((mp[xx][yy] + mp[x - 1][y - 1] - mp[x - 1][yy] - mp[xx][y - 1]) == sum - k ) ans++;
            
            //cout<<xx<<' '<<yy<< ' '<<x<<' '<<y<<endl;
            
        }
    }
    cout << ans << endl;
    return;
}
signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T_case = 1;
    cin >> T_case;
    while (T_case--) {
        solve();
    }
    return 0;
}