//
// Created by travel on 2024/10/10.
//
#include<bits/stdc++.h>
using namespace std;

#define int long long
const int N = 1e3 + 10;
int g[N][N],T,n,m,k;
bool vis[N][N];
void add(int a,int b,int c,int d){
    g[a][b]++; g[a][d + 1]--;
    g[c + 1][b]--;g[c + 1][d + 1]++;
}
void solve(){
    cin>>n>>m>>k;

    // 实际的矩阵边界索引
    int row1 = 1,row2 = n,col1 = 1,col2 = m;
    for(int i = 0;i <= n + 1;i++)
        for(int j = 0;j <= m + 1;j++)
            g[i][j] = 0,vis[i][j] = 0;
    // 四个边界所在矩阵的位置
    int row3 = 1,row4 = n,col3 = 1,col4 = m;
    string s; cin>>s;
    bool flag = 0;
    for(int i = 0;i < s.size();i++)
    {
        if(s[i] == 'U') {
            if(row3 == 1)
                row1++;
            if(row4 == 1) {
                flag = 1;
                break;
            }
            row3 = max(1ll,row3 - 1),row4 = max(1ll,row4 - 1);
        }
        if(s[i] == 'D'){
            if(row4 == n)
                row2--;
//            row3++,row4++;
            if(row3 == n)
            {
                flag = 1;
                break;
            }
            row3 = min(n,row3 + 1),row4 = min(n,row4 + 1);
        }
        if(s[i] == 'L'){
            if(col3 == 1)
                col1++;
//            col3--,col4--;
            if(col4 == 1){
                flag = 1;
                break;
            }
            col3 = max(1ll,col3 - 1),col4 = max(1ll,col4 - 1);
        }
        if(s[i] == 'R')
        {
            if(col4 == m)
                col2--;
//            col3++,col4++;
            if(col3 == m){
                flag = 1;
                break;
            }
            col3 = min(m,col3 + 1),col4 = min(m,col4 + 1);
        }
    }
//    cout<<"ok"<<endl;
    int res = 0;
//    cout<<row1<<' '<<row2<<' '<<col1<<' '<<col2<<endl;
    if(row1 > row2 || col1 > col2 || flag)
    {
        if(k) cout<<0<<endl;
        else cout<<m * n <<endl;
        return ;
    }
    else res = (row2 - row1 + 1) * (col2 - col1 + 1) - k;
//    cout<<"res = "<<res<<endl;
    if(res < 0){
        cout<<0<<endl;
        return ;
    }
//    cout<<row1<<' '<<col1<<endl;
    vis[row1][col1]  = 1;
    add(row1,col1,row2,col2);
    for(int i = 0;i < s.size();i++){
        if(s[i] == 'U')
            row1--,row2--;
        if(s[i] == 'D')
            row1++,row2++;
        if(s[i] == 'L')
            col1--,col2--;
        if(s[i] == 'R')
            col1++,col2++;
//        cout<<row1<<' '<<col1<<endl;
        if(!vis[row1][col1])
        {
            add(row1,col1,row2,col2);
            vis[row1][col1] = 1;
        }
    }
    int cnt = 0;
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= m;j++)
            g[i][j] +=g[i - 1][j] + g[i][j - 1] - g[i - 1][j - 1];
//    for(int i = 1;i <= n;i++){
//        for(int j = 1;j <= m;j++)
//            cout<<g[i][j]<<' ';
//        cout<<endl;
//    }
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++)
            if(g[i][j] == res)
                cnt++;
    }
    cout<<cnt<<endl;
}
signed main(){
    cin>>T;
    while(T--)
        solve();
    return 0;
}
/*
 *
1
 3 18 33
UDRLR
 */