#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;

struct node {
    int x, y, qid, zf;
    bool operator < (const node &o) const {
        if(x == o.x) {
            return qid < o.qid;
        } else {
            return x < o.x;
        }
    }
};

void solve() {
    int n, m, k; cin >> n >> m >> k;
    int mi_x = 0, ma_x = 0, mi_y = 0, ma_y = 0;
    int nowx = 0, nowy = 0;
    string s; cin >> s;
    set<pair<int, int>> dot;
    dot.insert({0, 0});
    for(int i = 0; i < (int) s.length(); i++) {
        if(s[i] == 'U') {
            nowy++;
        } else if(s[i] == 'D') nowy--;
        else if(s[i] == 'L') nowx--;
        else if(s[i] == 'R') nowx++;
        // cerr << " i = " << i << " " << nowx << " " << nowy << "\n";
        mi_x = min(mi_x, nowx);
        ma_x = max(ma_x, nowx);
        mi_y = min(mi_y, nowy);
        ma_y = max(ma_y, nowy);
        dot.insert({-nowx, -nowy});
    }
    int sx = ma_x + 1, sy = ma_y + 1;
    // cerr << "sx = " << sx << " sy = " << sy << '\n';
    vector<node> v;
    for(auto p : dot) {
        v.push_back({p.first + ma_x + 1, p.second + ma_y + 1, -1, 0});
    }
    // cerr << "dots = \n";
    int fenwick_mx = 1;
    for(auto p : v) {
        // cerr << p.x << " " << p.y << "\n";
        fenwick_mx = max(fenwick_mx, p.y);
    }
    fenwick_mx += 10;
    vector<int> c(fenwick_mx);
    auto query = [&] (int x) {
        if(x >= fenwick_mx) x = fenwick_mx - 1;
        if(x <= 0) return 0;
        int ret = 0;
        while(x) {
            ret += c[x];
            x -= x & -x;
        }
        return ret;
    };
    auto add = [&] (int x) {
        while(x < fenwick_mx) {
            c[x]++;
            x += x & -x;
        }
    };

    // cerr << mi_y << "\n";
    int lx = -mi_x + 1, rx = m - ma_x;
    int ly = -mi_y + 1, ry = n - ma_y;
    // cerr << "lrxy: " << lx << " " << rx << " " << ly << " " << ry << "\n";
    if(lx > rx || ly > ry) {
        if(k == 0) {
            cout << n * m << "\n";
        } else {
            cout << 0 << "\n";
        }
        return;
    }

    for(int i = 1; i <= m; i++) {
        for(int j = 1; j <= n; j++) {
            int tx = sx - i + 1, ty = sy - j + 1;
            int ttx = tx + lx - 1, tty = ty + ly - 1;
            // if(i == 3 && j == 1) {
            //     cerr << "ttdebug = " << ttx - 1 + rx - lx + 1 << " " << tty - 1 + ry - ly + 1 << "\n";
            // }
            v.push_back({ttx - 1, tty - 1, (i - 1) * n + j, 1});
            v.push_back({ttx - 1, tty - 1 + ry - ly + 1, (i - 1) * n + j, -1});
            v.push_back({ttx - 1 + rx - lx + 1, tty - 1, (i - 1) * n + j, -1}); 
            v.push_back({ttx - 1 + rx - lx + 1, tty - 1 + ry - ly + 1, (i - 1) * n + j, 1});
        }
    }

    vector<int> ans(n * m + 1);
    sort(v.begin(), v.end());
    for(node nd : v) {
        if(nd.qid == -1) {
            add(nd.y);
        } else {
            ans[nd.qid] += nd.zf * query(nd.y);
        }
    }
    // cerr << ans[14] << "\n";
    int cnt = 0;
    for(int i = 1; i <= n * m; i++) {
        if(ans[i] == (rx - lx + 1) * (ry - ly + 1) - k) cnt++;
    }
    cout << cnt << '\n';
}   

int main() {
    cin.tie(0)->sync_with_stdio(false);
    int t; cin >> t;
    while(t--) solve();
    return 0;
}

/*
4 5 3
ULDDRR
*/