#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int M, N, K;
int L;
char S[1'000'010];

int f[2010][2010];
int fSum[2010][2010];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d%d", &M, &N, &K);
    scanf("%s", S);
    L = strlen(S);
    
    // survival range
    int xL = 0, xR = M;
    int yL = 0, yR = N;
    for (int i = L; --i >= 0; ) {
      switch (S[i]) {
        case 'U': ++xL; ++xR; break;
        case 'D': --xL; --xR; break;
        case 'L': ++yL; ++yR; break;
        case 'R': --yL; --yR; break;
        default: assert(false);
      }
      chmax(xL, 0); chmin(xR, M);
      chmax(yL, 0); chmin(yR, N);
    }
    if (!(xL < xR)) xL = xR = 0;
    if (!(yL < yR)) yL = yR = 0;
// cerr<<"["<<xL<<", "<<xR<<"] * ["<<yL<<", "<<yR<<"]"<<endl;
    
    // hole moves
    vector<int> xs(L + 1), ys(L + 1);
    xs[0] = ys[0] = 0;
    for (int i = 0; i < L; ++i) {
      int &x = xs[i + 1] = xs[i];
      int &y = ys[i + 1] = ys[i];
      switch (S[i]) {
        case 'U': ++x; break;
        case 'D': --x; break;
        case 'L': ++y; break;
        case 'R': --y; break;
        default: assert(false);
      }
    }
    for (int x = 0; x <= 2 * M; ++x) {
      fill(f[x], f[x] + (2 * N), 0);
      fill(fSum[x], fSum[x] + (2 * N), 0);
    }
    for (int i = 0; i <= L; ++i) {
      const int x = M - 1 + xs[i];
      const int y = N - 1 + ys[i];
      if (0 <= x && x < 2 * M && 0 <= y && y < 2 * N) {
        f[x][y] = 1;
      }
    }
    for (int x = 0; x < 2 * M; ++x) for (int y = 0; y < 2 * N; ++y) {
      fSum[x + 1][y + 1] = fSum[x + 1][y] + fSum[x][y + 1] - fSum[x][y] + f[x][y];
    }
    int ans = 0;
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
      int num = 0;
      num += fSum[x + xL][y + yL];
      num -= fSum[x + xL][y + yR];
      num -= fSum[x + xR][y + yL];
      num += fSum[x + xR][y + yR];
      if ((xR - xL) * (yR - yL) - num == K) {
        ++ans;
      }
    }
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}