#pragma GCC optimize(2)
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define int long long

void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  string s;
  cin >> s;
  int l = 0, r = 0, b = 0, t = 0;
  int cx = 0, cy = 0;
  for (auto c : s) {
    if (c == 'U') {
      --cx;
    }
    if (c == 'D') {
      ++cx;
    }
    if (c == 'L') {
      --cy;
    }
    if (c == 'R') {
      ++cy;
    }
    t = min(t, cx);
    b = max(b, cx);
    l = min(l, cy);
    r = max(r, cy);
  }
  int aw = max(0ll, m - (r - l));
  int ah = max(0ll, n - (b - t));
  int sx = abs(t) + cx + 1;
  int sy = abs(l) + cy + 1;
  if (aw * ah == 0) {
    if (k) {
      cout << 0 << endl;
    } else {
      cout << n * m << endl;
    }
    return;
  }
  int bx = cx, by = cy;
  cx = 0, cy = 0;
  set<pair<int, int>> path;
  path.emplace(cx, cy);
  l = 0, r = 0, b = 0, t = 0;
  for (auto c : s) {
    if (c == 'U') {
      ++cx;
    }
    if (c == 'D') {
      --cx;
    }
    if (c == 'L') {
      ++cy;
    }
    if (c == 'R') {
      --cy;
    }
    path.emplace(cx, cy);
    t = min(t, cx);
    b = max(b, cx);
    l = min(l, cy);
    r = max(r, cy);
  }
  int h = b - t + 1, w = r - l + 1;
  vector<vector<int>> pre(h + 1, vector<int>(w + 1));
  auto p = pre;
  for (auto [x, y] : path) {
    p[x - t + 1][y - l + 1] = 1;
  }
  for (int i = 1; i <= h; ++i) {
    for (int j = 1; j <= w; ++j) {
      pre[i][j] = pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1] + p[i][j];
    }
  }
  auto get_range = [&](int x1, int y1, int x2, int y2) {
    if (x1 > x2 || y1 > y2) {
      return 0ll;
    }
    return pre[x2][y2] - pre[x1 - 1][y2] - pre[x2][y1 - 1]
           + pre[x1 - 1][y1 - 1];
  };
  int ans = 0;
  for (int i = bx + 1; i <= bx + n; ++i) {
    for (int j = by + 1; j <= by + m; ++j) {
      int x1 = t + 1;
      int y1 = l + 1;
      x1 = max(x1, sx - i + 1);
      y1 = max(y1, sy - j + 1);
      int x2 = b + 1;
      int y2 = r + 1;
      x2 = min(x2, (sx + ah - 1) - i + 1);
      y2 = min(y2, (sy + aw - 1) - j + 1);
      x1 -= t;
      x2 -= t;
      y1 -= l;
      y2 -= l;
      ans += get_range(x1, y1, x2, y2) == aw * ah - k;
    }
  }
  cout << ans << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}