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

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

    int T;
    cin >> T;
    while (T--) {
        int n, m, k;
        cin >> n >> m >> k;
        string s;
        cin >> s;
        int l = s.size();

        vector<int> dx(l + 1, 0);
        vector<int> dy(l + 1, 0);
        for (int i = 1; i <= l; ++i) {
            dx[i] = dx[i - 1];
            dy[i] = dy[i - 1];
            char c = s[i - 1];
            if (c == 'U') dx[i]--;
            else if (c == 'D') dx[i]++;
            else if (c == 'L') dy[i]--;
            else dy[i]++;
        }

        int min_dx = *min_element(dx.begin(), dx.end());
        int max_dx = *max_element(dx.begin(), dx.end());
        int min_dy = *min_element(dy.begin(), dy.end());
        int max_dy = *max_element(dy.begin(), dy.end());

        int x_min = 1 - min_dx;
        int x_max = n - max_dx;
        int y_min = 1 - min_dy;
        int y_max = m - max_dy;

        int valid_count = 0;
        if (x_min <= x_max && y_min <= y_max) {
            valid_count = (x_max - x_min + 1) * (y_max - y_min + 1);
        } else {
            valid_count = 0;
        }

        if (valid_count == 0) {
            cout << (k == 0 ? n * m : 0) << "\n";
            continue;
        }

        vector<vector<int>> diff(n + 2, vector<int>(m + 2, 0));

        for (int t = 0; t <= l; ++t) {
            int dx_t = dx[t];
            int dy_t = dy[t];

            int min_x = x_min + dx_t;
            int max_x = x_max + dx_t;
            int min_y = y_min + dy_t;
            int max_y = y_max + dy_t;

            if (min_x < 1 || max_x > n || min_y < 1 || max_y > m)
                continue;

            diff[min_x][min_y]++;
            if (max_y + 1 <= m)
                diff[min_x][max_y + 1]--;
            if (max_x + 1 <= n)
                diff[max_x + 1][min_y]--;
            if (max_x + 1 <= n && max_y + 1 <= m)
                diff[max_x + 1][max_y + 1]++;
        }

        for (int i = 1; i <= n; ++i) {
            int current = 0;
            for (int j = 1; j <= m; ++j) {
                current += diff[i][j];
                diff[i][j] = current;
            }
        }

        for (int j = 1; j <= m; ++j) {
            int current = 0;
            for (int i = 1; i <= n; ++i) {
                current += diff[i][j];
                diff[i][j] = current;
            }
        }

        int required = valid_count - k;
        int ans = 0;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                if (diff[i][j] == required) {
                    ans++;
                }
            }
        }

        cout << ans << "\n";
    }

    return 0;
}