//
//  main.cpp
//  ICPC2022nanjingA
//
//  Created by Xuan Cai on 2024/11/27.
//

#include <iostream>
using namespace std;
#include <vector>
#include <map>
#include <utility>
void solve(){
    int n , m  , k  ;
    cin >> n >> m >> k ;
    string s; cin >> s;
    int L = 1 , R = m , U = 1 , D = n ;
    int x = 0 , y = 0 ;
    for(int i = 0 ; i < s.size() ; i++){
        if(s[i] == 'L'  ){
            if(x <= 0 && L <= m ){
                L++;
            }
            x--;
        }
        if(s[i] == 'R'  ){
            if(x >= 0 && R >= 1  ){
                R--;
            }
            x++;
        }
        if(s[i] == 'U'  ){
            if(y <= 0 && U <= m ){
                U++;
            }
            y--;
        }
        if(s[i] == 'D'  ){
            if(y >= 0 && U >= 1  ){
                D--;
            }
            y++;
        }
    }
    if( L > R   ||  U > D ) {
        if(k == 0 ) {
            cout << m * n  << endl; return;
        }else {
            cout << 0  << endl; return;
        }
    }
    map<pair<int, int> , int > dian;
    map<pair<int, int> , int > sum;
    int X = m - L + 1; int Y = n - U + 1;
    dian[{X , Y  } ] = 1;
    int XL  = m- L + 1 , XR = m - L  + 1 , YU = n - U + 1  ,  YD  = n - U  + 1;
    for(int i = 0 ; i < s.size() ; i++){
        if(s[i] == 'U') Y++;
        if(s[i] == 'D') Y--;
        if(s[i] == 'L') X++;
        if(s[i] == 'R') X--;
        dian[{X, Y}] = 1;
        XL = min(XL , X ) ;
        XR = max(XR , X) ;
        YU = min(YU , Y);
        YD = max(YD , Y) ;
    }
    int shu = (R - L + 1 ) * (D - U + 1);
    for(int i = XL; i <= XR ; i++){
        for(int j = YU; j <= YD; j++){
            sum[{i , j}] = sum[{i - 1 ,j }] + sum[{i , j - 1}] + dian[{i ,j}] - sum[{i - 1 , j - 1}];
        }
    }
    int res = 0 ;
    for(int i = 1; i <= m ; i++){
        for(int j = 1; j <= n ; j++){
            int down = i + D - U;
            int right = j + R - L ;
            shu =  (R - L + 1 ) * (D - U + 1) - sum[{right, down}] +  sum[{ right , j - 1 }] +  sum[{ i - 1, down }] - sum[{ i - 1 , j - 1}] ;
            if(shu == k) res++;
        }
    }
    cout << res << endl;
}
int main(int argc, const char * argv[]) {
    int t; cin >> t;
    while(t--) solve();
    return 0;
}