# include <bits/stdc++.h>
using namespace std;
# define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
# define int long long
# define lowbit(x) (x & (-x))
# define fi first
# define se second
// # define endl '\n'

inline int Read();

typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const int N = 1e6 + 10;

map <PII, int> mp;
vector <int> v;

string a;
int b[2010][2010];
void Solve(){
    mp.clear();
    int n, m, k;
    cin >> n >> m >> k >> a;
    for(int i = 1; i <= n * 2; i ++){
        for(int j = 1; j <= m *2 ; j ++){
            b[i][j] = 0;
        }
    }
    int u = 1, d = n, l = 1, r = m;
    int x = 1, y = 1;
    int hx = 0, hy = 0;
    mp[{1, 1}] = 1;
    for(int i = 0; i < a.size(); i ++){
        if(a[i] == 'U'){
            u --; d --; x ++;
            // if(x < 1) x = 1;
            if(u < 1) u = 1;
            if(d < 1){
                if(k == 0) cout << n * m <<"\n";
                else cout << 0 <<"\n";
                return;
            }
        }
        if(a[i] == 'D'){
            u ++; d ++; x --;
            // if(x > n) x = n;
            if(d > n) d = n;
            if(u > n){
                if(k == 0) cout << n * m <<"\n";
                else cout << 0 <<"\n";
                return;
            }
        }
        if(a[i] == 'L'){
            l --; r --; y ++;
            // if(y > m) y = m;
            if(l < 1) l = 1;
            if(r < 1){
                if(k == 0) cout << n * m <<"\n";
                else cout << 0 <<"\n";
                return;
            }
        }
        if(a[i] == 'R'){
            l ++; r ++; y --;
            // if(y < 1) y = 1;
            if(r > m) r = m;
            if(l > m){
                if(k == 0) cout << n * m <<"\n";
                else cout << 0 <<"\n";
                return;
            }
        }
        mp[{x, y}] = 1;
        // cout << x <<" " << y <<"*\n";
    }
    int xx = 0, yy = 0;
    for(auto i : mp){
        xx = i.fi.fi;
        yy = i.fi.se;
        break;
    }
    // cout << xx <<" " << yy <<'\n';
    int tx = 1 - xx, ty = 1 - yy;
    int sx = 1 + tx, sy = 1 + ty;
    // cout << x <<" " << y <<"\n";
    for(auto i : mp){
        x = i.fi.fi;
        y = i.fi.se;
        b[x + tx][y + ty] ++;
    }
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
            // cout << b[i][j] <<" \n"[j == m];
        }
    }
    int ans = 0;
    // cout << u <<" " << d <<" " << l <<' ' << r <<"\n";
    // cout << sx <<" " << sy <<"\n";
    for(int i = (int)a.size() - 1; i >= 0; i --){
        if(a[i] == 'U') u ++, d ++;
        if(a[i] == 'D') u --, d --;
        if(a[i] == 'L') l ++, r ++;
        if(a[i] == 'R') l --, r --;
    }
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            int px, py;
            px = sx - (i + tx), py = sy - (j + ty);
            if(b[d + tx + px][r + ty + py] - b[d + tx + px][max(l - 1 + ty + py, 0ll)] - b[max(u - 1 + tx + px, 0ll)][r + ty + py] + b[max(u - 1 + tx + px, 0ll)][max(l - 1 + ty + py, 0ll)] == (d - u + 1) * (r - l + 1) - k) {
                ans ++;
                // cout << i <<" " << j <<" " << ans <<"\n";
            } 
        }
    }
    cout << ans << '\n';

}
signed main(){
    IOS;
    int T = 1;
    cin >> T;
    while (T--) 
        Solve();
    return 0;
}
inline int Read(){
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9'){ if (c == '-') f = -1; c = getchar();}
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}