#define _CRT_SECURE_NO_WARNINGS 0
#include <iostream> 
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<set>
#include<queue>
#include <stack>
#include<list>
#include<cstring>
#include<cmath>
#include <cstdlib>
#include<fstream>
#include<climits>
using namespace std;
typedef long long ll;
struct po {
    ll x, y;
    po(ll i=0, ll j=0) {
        x = i; y = j;
    }
};
ll mp[1000 + 100][1000 + 100] = { {0} },a[1000 + 100][1000 + 100] = { {0} };
void mark(po top, po bot) {
    mp[top.x][top.y] += 1;
    mp[top.x][bot.y+1] -= 1;
    mp[bot.x+1][top.y] -= 1;
    mp[bot.x+1][bot.y+1] += 1;
}
void solve() {
    map<pair<ll,ll>, int>check;
    int n, m, up = 0, down = 0, left = 0, right = 0;
    int k;
    scanf("%d %d %d", &n, &m, &k);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            mp[i][j] = 0;
            a[i][j] = 0;
        }
    }
    int height = n, width = m;
    string str;
    cin >> str;
    for (int i = 0; i < str.size(); i++)
    {
        if (str[i] == 'U') {
            if (up == 0) {
                height--;
            }
            else {
                up--;
            }
            down++;
        }
        else if (str[i] == 'D') {
            if (down == 0) {
                height--;
            }
            else {
                down--;
            }
            up++;
        }
        else if (str[i] == 'L') {
            if (left == 0) {
                width--;
            }
            else {
                left--;
            }
            right++;
        }
        else {
            if (right == 0) {
                width--;
            }
            else {
                right--;
            }
            left++;
        }
    }
    up++;
    left++;
    po top(up, left);
    po bot(up + height - 1, left + width - 1);
    if (height > 0 && width > 0) {
        mark(top, bot);
        check[{top.x,top.y}]++;
        for (int i = str.size() - 1; i >= 0; i--) {
            switch (str[i])
            {
            case('U'):
                top.x++;
                bot.x++;
                break;
            case('D'):
                top.x--;
                bot.x--;
                break;
            case('L'):
                top.y++;
                bot.y++;
                break;
            case('R'):
                top.y--;
                bot.y--;
                break;
            default:
                break;
            }
            if (check[{top.x, top.y}] == 0) {
                mark(top, bot);
                check[{top.x, top.y}]++;
            }
        }
    }
    
    ll total = max(height * width,0);
    ll cnt = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            a[i][j] = a[i-1][j]+a[i][j-1]-a[i-1][j-1]+mp[i][j];
            //cout << a[i][j]<<" ";
            if (total - a[i][j] == k) {
                cnt++;
            }
        }
        //cout << "\n";
    }
    cout << cnt<<"\n";
}
int main() {

    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}