#include <bits/stdc++.h>

using namespace std;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    int n, m, k; 
    string s;
    cin >> n >> m >> k >> s;
    int verShift = 0, horShift = 0;
    int upAt = 0, downAt = n - 1, leftAt = 0, rightAt = m - 1;
    for (char c : s) {
      if (c == 'U') --upAt, --downAt, --verShift;
      if (c == 'D') ++upAt, ++downAt, ++verShift;
      if (c == 'L') --leftAt, --rightAt, --horShift;
      if (c == 'R') ++leftAt, ++rightAt, ++horShift;
      upAt = max(upAt, 0), downAt = min(downAt, n - 1);
      leftAt = max(leftAt, 0), rightAt = min(rightAt, m - 1);
    }
    if (upAt > downAt or leftAt > rightAt) {
      cout << (k ? 0 : n * m) << '\n';
      continue;
    }
    upAt -= verShift, downAt -= verShift;
    leftAt -= horShift, rightAt -= horShift;
    int verDim = downAt - upAt, horDim = rightAt - leftAt;
    int target = (verDim + 1) * (horDim + 1) - k;
    if (target < 0) {
      cout << "0\n";
      continue;
    }
    int x_lo = upAt - n + 1, x_hi = upAt;
    int y_lo = leftAt - m + 1, y_hi = leftAt;
    vector <pair <int, int>> where(s.size() + 1);
    where[0] = make_pair(0, 0);
    for (int i = 0; i < s.size(); ++i) {
      where[i + 1] = where[i];
      if (s[i] == 'U') ++where[i + 1].first;
      if (s[i] == 'D') --where[i + 1].first;
      if (s[i] == 'L') ++where[i + 1].second;
      if (s[i] == 'R') --where[i + 1].second;
    }
    for (auto &[x, y] : where) x -= x_lo, y -= y_lo;
    int maxVerDim = n + verDim, maxHorDim = m + horDim;
    vector <vector <int>> pref(maxVerDim + 1, vector <int> (maxHorDim + 1, 0));
    for (auto &[x, y] : where) if (x >= 0 and x < maxVerDim and y >= 0 and y < maxHorDim) {
      pref[x + 1][y + 1] = 1;
    }
    for (int i = 1; i <= maxVerDim; ++i) for (int j = 1; j <= maxHorDim; ++j) {
      pref[i][j] += pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {
      int here = pref[i + verDim + 1][j + horDim + 1] - pref[i][j + horDim + 1] - pref[i + verDim + 1][j] + pref[i][j];
      if (here == target) ++ans;
    }
    cout << ans << '\n';
  }
  return 0;
}