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

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 ;
    int xl =0;
    int xr = 0 ;
    int yl = 0;
    int yr = 0 ;
    for(int i = 0 ; i < s.size() ; i++){
        if(s[i] == 'L'  ) x--;
        if(s[i] == 'R'  ) x++;
        if(s[i] == 'U'  ) y--;
        if(s[i] == 'D'  ) y++;
        xl = min(xl , x) ;
        xr = max(xr , x) ;
        yl = min(yl ,y) ;
        yr = max(yr , y);
    }
    L = 1 + abs(xl);
    R = m - abs(xr);
    U = 1 + abs(yl);
    D = n - abs(yr) ;
    //cout << L  << " " << R <<" " << U << " " << D  <<endl;
    if( L > R   ||  U > D ) {
        if(k == 0 ) {
            cout << m * n  << endl; return;
        }else {
            cout << 0  << endl; return;
        }
    }
    vector<vector<int> > vec(3 * m , vector<int> ( 3 * n , 0 ) );
    vector<vector<int> > sum(3 * m , vector<int> ( 3 * n , 0 ) );
    /*map<pair<int, int> , int > dian;
    map<pair<int, int> , int > sum;*/
    int X = m - L + 1   + m ; int Y = n - U + 1  + n ;
    //dian[{X , Y  } ] = 1;
    vec[X][Y] = 1;
    int XL  = X , XR =  X  , YU =  Y,  YD = Y ;
    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--;
        vec[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 = 1; i <= 3 * m - 1 ; i++){
        for(int j = 1; j <=  3 * n  - 1   ; j++){
            sum[i][j] = sum[i - 1][j] + sum[i][j - 1] + vec[i][j] - sum[i - 1][j - 1];
            //sum[{i , j}] = sum[{i - 1 ,j }] + sum[{i , j - 1}] + dian[{i ,j}] - sum[{i - 1 , j - 1}];
          //  cout << i << " " << j << " " <<  sum[{i, j}] << endl;
        }
    }

    int res = 0 ;
    for(int i = 1 + m; i <=  2 * m ; i++){
        for(int j = 1 +  n ; j <= 2 *  n ; j++){
            int down = j + D - U;
            int right = i + 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}] ;
            shu =  (R - L + 1 ) * (D - U + 1) - sum[right][down] + sum[right][j - 1] + sum[i - 1][down] - sum[i -1][j - 1];
          //  cout << i << " " << j << " " << right << " " << down << " " <<  shu << endl
            if(shu == k) res++;
        }
    }
    cout << res << endl;
}
int main(int argc, const char * argv[]) {
    int t; cin >> t;
    while(t--) solve();
    return 0;
}