#include<bits/stdc++.h>
#define endl '\n'
#define db debug
#define debug(x) cout << #x << " is " << x << endl

using namespace std;

const int MAXN = 1010;
const int MAXL = 1000010;

int t;
int n, m, k;
char s[MAXL];
bool vis[MAXN][MAXN];

struct BITree{
    int a[MAXN][MAXN];
    inline int lowbit(int x){ return x & -x; }
    inline void add(int x, int y, int k){
        for (int i = x; i <= n + 5; i += lowbit(i))
            for (int j = y; j <= m + 5; j += lowbit(j))
                a[i][j] += k;
        return;
    }
    inline int query(int x, int y){
        int res = 0;
        for (int i = x; i; i -= lowbit(i))
            for (int j = y; j; j -= lowbit(j))
                res += a[i][j];
        return res;
    }
    inline void add(int x1, int y1, int x2, int y2, int k){
        // cout << "ADD: " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << ' ' << k << endl;
        add(x1, y1, k);
        add(x1, y2 + 1, -k);
        add(x2 + 1, y1, -k);
        add(x2 + 1, y2 + 1, k);
        return;
    }
} tr;

int main(){
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    ios:: sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    // for (int i = 1; i <= 5; ++i){
    //     for (int j = 1; j <= 5; ++j) cout << tr.query(i, j, i, j) << ' ';
    //     cout << endl;
    // }
    // cout << endl;
    // tr.add(1, 1, 5, 5, 1);
    // for (int i = 1; i <= 5; ++i){
    //     for (int j = 1; j <= 5; ++j) cout << tr.query(i, j, i, j) << ' ';
    //     cout << endl;
    // }
    // return 0;
    cin >> t;
    while (t--){
        cin >> n >> m >> k;
        cin >> s + 1;
        int l = strlen(s + 1);
        int mxx, mxy, mnx, mny;
        mxx = mxy = mnx = mny = 1;
        int nowx = 1, nowy = 1;
        for (int i = 1; i <= l; ++i){
            if (s[i] == 'U') --nowx;
            else if (s[i] == 'D') ++nowx;
            else if (s[i] == 'L') --nowy;
            else ++nowy;
            mxx = max(mxx, nowx), mxy = max(mxy, nowy);
            mnx = min(mnx, nowx), mny = min(mny, nowy);
        }
        int x1, y1, x2, y2;
        x1 = 2 - mnx;
        y1 = 2 - mny;
        x2 = n + 1 - mxx;
        y2 = m + 1 - mxy;
        // debug(x1), debug(y1), db(x2), db(y2);
        int lenx = x2 - x1, leny = y2 - y1;
        int surv = (lenx + 1) * (leny + 1);
        if (lenx < 0 || leny < 0){
            if (k == 0) cout << n * m << endl;
            else cout << 0 << endl;
            continue;
        }
        int rem = surv - k;
        tr.add(x1, y1, x1 + lenx, y1 + leny, 1);
        vis[x1][y1] = true;
        nowx = x1, nowy = y1;
        for (int i = 1; i <= l; ++i){
            if (s[i] == 'U') --nowx;
            else if (s[i] == 'D') ++nowx;
            else if (s[i] == 'L') --nowy;
            else ++nowy;
            // db(nowx), db(nowy);
            if (vis[nowx][nowy]) continue;
            vis[nowx][nowy] = true;
            tr.add(nowx, nowy, nowx + lenx, nowy + leny, 1);
        }
        int res = 0;
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= m; ++j){
                int r = tr.query(i, j);
                if (r == rem) ++res;
                // debug(r);
            }
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= m; ++j)
                if (vis[i][j]){
                    tr.add(i, j, i + lenx, j + leny, -1);
                    vis[i][j] = false;
                }
        cout << res << endl;
    }
    return 0;
}

/*

3
4 5 3
ULDDRR

*/