#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)x.size())
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
using ll = long long;
using PII = pair<int,int>;
using db = double;
using ull = unsigned long long;
mt19937 mrand(random_device{}());
const int N = 2010, M = 30, inf = 1e9, mod = 1e9 + 7;

int n,m,k;
int s[N][N];

void solve(){
    cin >> n >> m >> k;
    string str;  cin >> str;
    int mu = 0,md = n - 1,ml = 0,mr = m - 1,dx = 0,dy = 0;
    rep(i,1,2*n + 1) rep(j,1,2*m + 1) s[i][j] = 0;
    s[n][m] = 1;
    for (auto c : str){
        if (c == 'U') dx++;
        if (c == 'D') dx--;
        if (c == 'L') dy++;
        if (c == 'R') dy--;
        int a = n + dx, b = m + dy;
        if (a > 0 && a <= 2*n && b > 0 && b <= 2*m) s[a][b] = 1;
        mu = max(mu,dx);
        md = min(md,dx + n - 1);
        ml = max(ml,dy);
        mr = min(mr,dy + m - 1);
    }

    int re = 0;
    if (mr < ml || md < mu) re = 0;
    else re = (mr - ml + 1)*(md - mu + 1);

    if (re == 0){
        if (k == 0) cout << n*m << "\n";
        else cout << 0 << "\n";
        return ;
    }

    rep(i,1,2*n + 1) rep(j,1,2*m + 1) s[i][j] += s[i - 1][j];
    rep(i,1,2*n + 1) rep(j,1,2*m + 1) s[i][j] += s[i][j - 1];

    auto check = [&](int i,int j){
        int x2 = md + n - i, y2 = mr + m - j,x1 = mu + n - i,y1 = ml + m - j;
        int sum = s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];
        return re - sum == k;
    };

    int ans = 0;
    for (int i = 0;i < n;i++){
        for (int j = 0;j < m;j++){
            if (check(i,j)) {
                ans++;
            }
        }
    }
    cout << ans << "\n";
}

int main(){
    IOS
    int t;
    cin >> t;
    // t = 1;
    while (t--) solve();
    return 0;
}