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

const int MAXN = 1005;
bool vis[MAXN][MAXN];
int a[MAXN][MAXN];
int n, m, k;
string s;

void solve() {
    cin >> n >> m >> k >> s;
    memset(vis, 0, sizeof(vis));
    memset(a, 0, sizeof(a));
    
    int lx = 1, ly = 1, rx = n, ry = m, dx = 0, dy = 0;
    for (char c : s) {
        if (c == 'U') {
            dx++;
            if (rx + dx > n) rx--;
        } else if (c == 'D') {
            dx--;
            if (lx + dx < 1) lx++;
        } else if (c == 'L') {
            dy++;
            if (dy + ry > m) ry--;
        } else if (c == 'R') {
            dy--;
            if (dy + ly < 1) ly++;
        }
    }
    
    if (lx > rx || ly > ry) {
        cout << (k == 0 ? n * m : 0) << endl;
        return;
    }
    
    dx = lx, dy = ly;
    vis[dx][dy] = true;
    for (char c : s) {
        if (c == 'U') dx++;
        else if (c == 'D') dx--;
        else if (c == 'L') dy++;
        else if (c == 'R') dy--;
        vis[dx][dy] = true;
    }
    
    rx = rx - lx + 1, ry = ry - ly + 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (vis[i][j]) {
                a[i][j]++;
                a[i + rx][j]--;
                a[i][j + ry]--;
                a[i + rx][j + ry]++;
            }
        }
    }
    
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
            if (rx * ry - a[i][j] == k) ans++;
        }
    }
    
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}