#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <array>
#include <iterator>
#include <algorithm>
// #include <bit>
#include <numeric>
#include <iomanip>
using namespace std;
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<short, short> pss;
#define el << '\n'
#define nl cout << '\n'
#define cina(a,n) for (int i=0; i<n; i++) cin >> a[i]
#define spc << ' '
#define forn(i,n) for (int i=0; i<n; i++)
#define forl(i,s,e) for (int i=s; i<e; i++)
#define pb push_back
#define fi first
#define se second
#define MAX *max_element
#define MIN *min_element
#define rsz resize
#define sz(x) ((int) x.size())
#define all(x) x.begin(), x.end()
#define bsi(x, v) (int) (lower_bound(x.begin(), x.end(), v) - x.begin())
const int inf = 1000000000;
const ll inf2 = 4000000000000000000;

void smin(int& a, int b) {
    if (b<a) a=b;
}

void smax(int& a, int b) {
    if (b>a) a=b;
}

const int MAXN = 1005;
int n, m, k;
// set<pii> l;

int ps[MAXN*2][MAXN*2];
int a[MAXN*2][MAXN*2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t; cin >> t;
    int temp = 0;
    while (t--) {
        temp++;
        // l.clear();
        cin >> n >> m >> k;
        forn(i,2*n+5) forn(j,2*m+2) {
            a[i][j] = 0;
            ps[i][j] = 0;
        }
        string s; cin >> s;
        // if (temp == 7) cout << s;
        // if (temp == 22) cout << n spc << m spc << k spc << s el;
        // l.insert({0,0});
        int sx=0, sy=0, lx=0, ly=0;
        int cx = 0, cy = 0;
        a[n][m]=1;
        for (char i : s) {
            if (i == 'U') cx++;
            else if (i == 'D') cx--;
            else if (i == 'L') cy++;
            else cy--;
            // l.insert({cx, cy});
            smin(sx, cx); smax(lx, cx);
            smin(sy, cy); smax(ly, cy);
            if (-n <= cx && cx <= n && -m <= cy && cy <= m) a[cx+n][cy+m]=1;
        }

        // forn(i,2*n) {
        //     forn(j,2*m) cout << a[i][j];
        //     nl;
        // }
        // nl;
        int ns = max(n+sx-lx,0)*max(m+sy-ly,0);
        // cout << n+sx-lx spc << m+ly-sy el;
        if (ns == 0) {
            if (k == 0) cout << n*m el;
            else cout << 0 el;
            continue;
        }
        forn(i,2*n+1) forn(j,2*m+1) ps[i+1][j+1] = ps[i][j+1] + ps[i+1][j] - ps[i][j] + a[i+1][j+1];
        int tot = 0;
        forl(i,1,n+1) forl(j,1,m+1) {
            int xl = lx - i;
            int xr = n + sx - i; 
            int yl = ly - j;
            int yr = m + sy - j;
            int v = ps[xr+n][yr+m] - ps[xl+n][yr+m] - ps[xr+n][yl+m] + ps[xl+n][yl+m];
            if ((xr-xl)*(yr-yl) - v == k) {
                tot++;
                // cout << i spc << j el;
            }
        } 
        cout << tot el;
    }
}