#include <bits/stdc++.h>

const int N = 1010, SIZE = 1000100;

int n, m, tar;

int step_len;
char step[SIZE];

int nn, mm;
int sum[N][N];

void work() {
    scanf("%d%d%d", &n, &m, &tar);

    scanf("%s", step + 1);
    step_len = strlen(step + 1);

    int le = 0, rg = 0, up = 0, dn = 0;
    int dx = 0, dy = 0;

    for (int i = 1; i <= step_len; i ++) {
        if (step[i] == 'U') dx --;
        if (step[i] == 'D') dx ++;
        if (step[i] == 'L') dy --;
        if (step[i] == 'R') dy ++;

        if (dx > 0) dn = std::max(dn, dx);
        if (dx < 0) up = std::max(up, -dx);
        if (dy > 0) rg = std::max(rg, dy);
        if (dy < 0) le = std::max(le, -dy);
    }

    int xL = up + 1, xR = n - dn;
    int yL = le + 1, yR = m - rg;

    if (xL > xR || yL > yR) {
        printf("%d\n", tar ? 0 : n * m);
        return;
    }

    nn = dn + 1 + up, mm = rg + 1 + le;

    for (int i = 1; i <= nn; i ++)
        for (int j = 1; j <= mm; j ++)
            sum[i][j] = 0;

    int st_x, st_y;
    int cur_x = st_x = dn + 1, cur_y = st_y = rg + 1; sum[cur_x][cur_y] = 1;
    for (int i = 1; i <= step_len; i ++) {
        if (step[i] == 'U') cur_x ++;
        if (step[i] == 'D') cur_x --;
        if (step[i] == 'L') cur_y ++;
        if (step[i] == 'R') cur_y --;

        sum[cur_x][cur_y] = 1;
    }

    for (int i = 1; i <= nn; i ++)
        for (int j = 1; j <= mm; j ++)
            sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
    
    int ans = 0;
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= m; j ++) {
            int x1 = std::max(1, i - dn), y1 = std::max(1, j - rg);
            int x2 = std::min(n, i + up), y2 = std::min(m, j + le);

            int cur_cnt = (xR - xL + 1) * (yR - yL + 1);

            int X1 = std::max(x1, xL), Y1 = std::max(y1, yL);
            int X2 = std::min(x2, xR), Y2 = std::min(y2, yR);

            if (X1 <= X2 && Y1 <= Y2) {
                int delta_x = i - st_x, delta_y = j - st_y;
                X1 -= delta_x, X2 -= delta_x, Y1 -= delta_y, Y2 -= delta_y;

                cur_cnt -= sum[X2][Y2] - sum[X1 - 1][Y2] - sum[X2][Y1 - 1] + sum[X1 - 1][Y1 - 1];
            }

            if (cur_cnt == tar) {
                ans ++;
                // printf(" (%d, %d)\n", i, j);
            }
        }
    
    printf("%d\n", ans);
}

int main() {
    int T;
    scanf("%d", &T);

    while (T --)
        work();
    
    return 0;
}