//g++-13 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

random_device seed;
mt19937_64 randint(seed());

ll grr(ll mi, ll ma) { // [mi, ma)
    return mi + randint() % (ma - mi);
}

string dir = "UDLR";

vi dx = {-1,1,0,0};
vi dy = {0,0,-1,1};

void solve(){
  int n,m,k;cin>>n>>m>>k;
  string s;cin>>s;
  vvi im((n+1),vi(m+1,0));

  int dxl=0,dxr=0,dyl=0,dyr=0;
  {
    int x=0,y=0;
    rep(i,0,s.size()){
      rep(j,0,4){
        if(s[i]==dir[j]){
          x+=dx[j];y+=dy[j];
        }
      }
      dxl=min(dxl,x);
      dxr=max(dxr,x);
      dyl=min(dyl,y);
      dyr=max(dyr,y);
    }
  }

  int sxl=-dxl,sxr=n-1-dxr,syl=-dyl,syr=m-1-dyr;
  int area=(sxr-sxl+1)*(syr-syl+1);
  if(sxl>sxr||syl>syr){
    if(k==0){
      cout<<n*m<<"\n";
    }
    else{
      cout<<0<<"\n";
    }
    return;
  }

  map<pair<int,int>,int> mp;

  auto sub=[&](int x,int y){
    im[sxl+x][syl+y]++;
    im[sxl+x][syr+y+1]--;
    im[sxr+x+1][syl+y]--;
    im[sxr+x+1][syr+y+1]++;
    mp[{x,y}]=1;
  };

  sub(0,0);

  {
    int x=0,y=0;
    rep(i,0,s.size()){
      rep(j,0,4){
        if(s[i]==dir[j]){
          x+=dx[j];y+=dy[j];
        }
      }
      if(mp[{x,y}]==0){
        sub(x,y);
      }
    }
  }

  rep(i,0,n+1){
    rep(j,1,m+1){
      im[i][j]+=im[i][j-1];
    }
  }
  
  rep(i,1,n+1){
    rep(j,0,m+1){
      im[i][j]+=im[i-1][j];
    }
  }

  int ans=0;
  rep(i,0,n){
    rep(j,0,m){
      if(im[i][j]+k==area)ans++;
    }
  }
  cout<<ans<<endl;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

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