#include <bits/stdc++.h>

using namespace std;

const int N = 1e3 + 10;
int n, m, k, len, S[N + N][N + N]; string s;

inline int get(int Lx, int Rx, int Ly, int Ry) {
    Lx += n, Rx += n, Ly += m, Ry += m;
    assert(Lx >= 1 && Rx >= 1 && Ly >= 1 && Ry >= 1);
    assert(Lx <= 2 * n && Rx <= 2 * n && Ly <= 2 * m && Ry <= 2 * m);
    assert(Lx <= Rx && Ly <= Ry);
    return S[Rx][Ry] - S[Lx - 1][Ry] - S[Rx][Ly - 1] + S[Lx - 1][Ly - 1];
}

inline int solve() {
    set<pair<int, int>> Set;
    cin >> n >> m >> k;
    for(int i = 0; i <= 2 * n; i ++) for(int j = 0; j <= 2 * m; j ++) S[i][j] = 0;
    int row_L = 1, row_R = n, col_L = 1, col_R = m;
    cin >> s; len = s.size();
    Set.insert({0, 0});
    for(int i = 0, delta_row = 0, delta_col = 0; i < len; i ++) {
        if(s[i] == 'U') delta_row --, row_R = min(row_R, n + delta_row);
        else if(s[i] == 'D') delta_row ++, row_L = max(row_L, 1 + delta_row);
        else if(s[i] == 'L') delta_col --, col_R = min(col_R, m + delta_col);
        else delta_col ++, col_L = max(col_L, 1 + delta_col);
        Set.insert({-delta_row, -delta_col});        
    }
    if(row_L > row_R || col_L > col_R) return (k == 0 ? n * m : 0);
    int siz = (row_R - row_L + 1) * (col_R - col_L + 1);
    if(siz < k) return 0; siz -= k; // we should delete siz kangaroos
    for(auto &pr : Set) S[pr.first + n][pr.second + m] ++;
    for(int i = 1; i <= 2 * n; i ++) S[i][0] += S[i - 1][0];
    for(int j = 1; j <= 2 * m; j ++) S[0][j] += S[0][j - 1];
    for(int i = 1; i <= 2 * n; i ++) for(int j = 1; j <= 2 * m; j ++) {
        S[i][j] = S[i][j] + S[i - 1][j] + S[i][j - 1] - S[i - 1][j - 1];
    }

    int res = 0;
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= m; j ++) {
        // check if the hole can be in (i, j)
        res += (get(row_L - i, row_R - i, col_L - j, col_R - j) == siz);
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);

    int T; cin >> T;
    while(T --) cout << solve() << '\n';

    return 0;
}