#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

// Function to compute cumulative sum
int cumsum(const vector<vector<int>>& C, int a, int b, int c, int d) {
    if (a >= b || c >= d) {
        return 0;
    }
    return C[b][d] + C[a][c] - C[a][d] - C[b][c];
}

int main() {
    int T;
    cin >> T;
    
    while (T--) {
        int N, M, K;
        cin >> N >> M >> K;
        
        string S;
        cin >> S;
        
        int le = S.length();
        int x0 = 0, x1 = N;
        int y0 = 0, y1 = M;
        int x = 0, y = 0;
        
        vector<int> X = {x}, Y = {y};
        
        for (char s : S) {
            if (s == 'U') {
                x -= 1;
            } else if (s == 'D') {
                x += 1;
            } else if (s == 'R') {
                y -= 1;
            } else if (s == 'L') {
                y += 1;
            }
            x0 = max(x0, x);
            x1 = min(x1, N + x);
            y0 = max(y0, y);
            y1 = min(y1, M + y);
            X.push_back(x);
            Y.push_back(y);
        }
        
        x1 = max(x1, x0);
        y1 = max(y1, y0);
        
        int minX = *min_element(X.begin(), X.end());
        int minY = *min_element(Y.begin(), Y.end());
        
        for (int i = 0; i <= le; ++i) {
            X[i] -= minX;
            Y[i] -= minY;
        }
        
        int leX = *max_element(X.begin(), X.end()) + 1;
        int leY = *max_element(Y.begin(), Y.end()) + 1;
        
        vector<vector<int>> C(leX + 1, vector<int>(leY + 1, 0));
        
        for (int i = 0; i <= le; ++i) {
            C[X[i] + 1][Y[i] + 1] = 1;
        }
        
        for (int i = 0; i <= leX; ++i) {
            for (int j = 1; j <= leY; ++j) {
                C[i][j] += C[i][j - 1];
            }
        }
        
        for (int i = 1; i <= leX; ++i) {
            for (int j = 0; j <= leY; ++j) {
                C[i][j] += C[i - 1][j];
            }
        }
        
        int ans = 0;
        for (int x = 0; x < N; ++x) {
            for (int y = 0; y < M; ++y) {
                int dx = x - X[0], dy = y - Y[0];
                if ((x1 - x0) * (y1 - y0) == K + cumsum(C, max(0, x0 - dx), min(leX, x1 - dx), max(0, y0 - dy), min(leY, y1 - dy))) {
                    ans += 1;
                }
            }
        }
        
        cout << ans << endl;
    }
    
    return 0;
}