#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<double,double> PLL;
const int N=1e6+10;
const int INF=0x3f3f3f3f;

ll t;
ll n,m,k;
string str;


    int main (void)
    {
        cin>>t;
        while(t--)
        {
            cin>>n>>m>>k;
            vector<vector<ll>> Map(n+2,vector<ll>(m+2,0));
            cin>>str;
            ll Len=str.size();
            ll l=1,r=m,u=1,d=n;
            ll Height=0,Width=0;
            for(int i=0;i<Len;i++)
            {
                if(str[i]=='U')
                    Height--;
                else if(str[i]=='L')
                     Width--;
                else if(str[i]=='D')
                    Height++;
                else if(str[i]=='R')
                    Width++;
                if((u+Height)<1)
                    u++;
                else if((d+Height)>n)
                    d--;
                else if((l+Width)<1)
                    l++;
                else if((r+Width)>m)
                    r--;
            }
            ll num=0;
            if(l>r||u>d) {
                num = 0;
                if(k==0)
                    cout<<n*m<<endl;
                else
                    cout<<"0\n";
            }
            else if(k>=n*m)
                cout<<"0\n";
            else {
                num = (r - l + 1) * (d - u + 1);
//            cout<<l<<" "<<r<<" "<<" "<<u<<" "<<d<<" "<<num<<endl;
                Map[u][l] += 1;
                Map[d + 1][l] -= 1;
                Map[u][r + 1] -= 1;
                Map[d + 1][r + 1] += 1;
                for (int i = 0; i < Len; i++) {
                    // 经过一系列变化
                    if (str[i] == 'U') {
                        u--;
                        d--;
                    } else if (str[i] == 'L') {
                        l--;
                        r--;
                    } else if (str[i] == 'D') {
                        u++;
                        d++;
                    } else if (str[i] == 'R') {
                        l++;
                        r++;
                    }
                    // 左上角 (u,l)   右下角 (d,r)
//                    cout << l << " " << r << " " << " " << u << " " << d << endl;
                    Map[u][l] += 1;
                    Map[d + 1][l] -= 1;
                    Map[u][r + 1] -= 1;
                    Map[d + 1][r + 1] += 1;
                }
                ll ans = 0;
//                cout << num << " " << k << endl;
                for (int i = 1; i <= n; i++) {
                    for (int j = 1; j <= m; j++) {
                        Map[i][j] += Map[i - 1][j] + Map[i][j - 1] - Map[i - 1][j - 1];
//                        cout << Map[i][j] << " ";
                        if (Map[i][j] == (num - k))
                            ans++;
                    }
//                    cout << endl;
                }

                cout << ans << endl;
            }
        }
        return 0;
    }