#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
const int N = 1005;
int n, m, k;
string s;
int xl, xr, yl, yr;

vector<pair<int, int> > nums;

int mp[N][N];

void solve() {
    cin >> n >> m >> k;
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            mp[i][j] = 0;
        }
    }
    cin >> s;
    xl = 1, xr = n, yl = 1, yr = m;
    int nxl = 1, nxr = n, nyl = 1, nyr = m;
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == 'U') {
            nyl++, nyr++;
            if (nyl > m) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nyr > m) {
                nyr = m;
                yr--;
            }
        }
        else if (s[i] == 'D') {
            nyl--, nyr--;
            if (nyr < 1) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nyl < 1) {
                nyl = 1;
                yl++;
            }
        }
        else if (s[i] == 'L') {
            nxl--, nxr--;
            if (nxr < 1) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nxl < 1) {
                nxl = 1;
                xl++;
            }
        }
        else if (s[i] == 'R') {
            nxl++, nxr++;
            if (nxl > n) {
                if (k == 0)cout << n * m << endl;
                else cout << 0 << endl;
                return;
            }
            if (nxr > n) {
                nxr = n;
                xr--;
            }
        }
    }
    int sum = (yr - yl + 1) * (xr - xl + 1);
    int x = 0, y = 0;
    nums.push_back({ x,y });
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == 'U') {
            y--;
            nums.push_back({ x,y });
        }
        else if (s[i] == 'D') {
            y++;
            nums.push_back({ x,y });
        }
        else if (s[i] == 'L') {
            x++;
            nums.push_back({ x,y });
        }
        else if (s[i] == 'R') {
            x--;
            nums.push_back({ x,y });
        }
    }
    
    int mix = 1e18, miy = 1e18;
    for (auto p = nums.begin(); p != nums.end(); p++) {
        mix = min(mix, p->first);
        miy = min(miy, p->second);
    }
    mix--; miy--;
    mix = -mix, miy = -miy;
    for (auto p = nums.begin(); p != nums.end(); p++) {
        mp[p->first + mix][p->second + miy] = 1;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            mp[i][j] = mp[i][j] + mp[i - 1][j] + mp[i][j - 1] - mp[i - 1][j - 1];
           // cout<<mp[i][j]<<' ';
        }//cout<<endl;
    }

    int ans = 0;
    //枚举起点，1,1一直到n,m;
    for (int dx = 1; dx <= n; dx++) {
        for (int dy = 1; dy <= m; dy++) {
            int i = xl - dx, j = yl - dy;
            int x = mix + i, y = miy + j;
            int xx = mix + i + (xr - xl), yy = miy + j + (yr - yl);
          //  cout<<xx<<' '<<yy<< ' '<<x<<' '<<y<<endl;
            if ((mp[xx][yy] + mp[x - 1][y - 1] - mp[x - 1][yy] - mp[xx][y - 1]) == sum - k )ans++;
        }
    }
    cout << ans << endl;
    return;
}
signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T_case = 1;
    cin >> T_case;
    while (T_case--) {
        solve();
    }
    return 0;
}