#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
  x = 0;
  int c = getchar(), f = 1;
  for (; !isdigit(c); c = getchar())
    if (c == 45) f = -1;
  for (; isdigit(c); c = getchar()) (x *= 10) += f * (c - '0');
}
int n;
char s[200000 + 5];
vector<int> seq[2];
int pos[200000 + 5], pre[2][200000 + 5], suf[2][200000 + 5];
int calc(vector<int> vec) {
  int l = 0, r = 0, p = 0;
  for (int x : vec) p += x, l = min(l, p), r = max(r, p);
  return r - l + 1;
}
int insert(vector<int> vec) {
  pos[0] = pre[0][0] = pre[1][0] = 0;
  suf[0][vec.size()] = suf[1][vec.size()] = 0;
  for (int i = 0; i < (int)vec.size(); i++)
    pos[i + 1] = pos[i] + vec[i], pre[0][i + 1] = min(pre[0][i], pos[i + 1]),
            pre[1][i + 1] = max(pre[1][i], pos[i + 1]);
  for (int i = (int)vec.size() - 1; ~i; i--)
    suf[0][i] = min(suf[0][i + 1] + vec[i], 0),
    suf[1][i] = max(suf[1][i + 1] + vec[i], 0);
  int mi = 0x3f3f3f3f;
  for (int d = -1; d <= 1; d += 2)
    for (int i = 0, l, r; i <= (int)vec.size(); i++)
      l = min(pre[0][i], pos[i] + suf[0][i] + d),
      r = max(pre[1][i], pos[i] + suf[1][i] + d), mi = min(mi, r - l + 1);
  return mi;
}
int main() {
  int T;
  read(T);
  while (T--) {
    scanf("%s", s), n = (int)strlen(s);
    for (int i = 0; i < n; i++) {
      if (s[i] == 'W') seq[0].push_back(1);
      if (s[i] == 'S') seq[0].push_back(-1);
      if (s[i] == 'D') seq[1].push_back(1);
      if (s[i] == 'A') seq[1].push_back(-1);
    }
    long long a = 1LL * insert(seq[0]) * calc(seq[1]);
    long long b = 1LL * calc(seq[0]) * insert(seq[1]);
    long long c = 1LL * calc(seq[0]) * calc(seq[1]);
    printf("%lld\n", min(min(a, b), c));
    seq[0].clear(), seq[1].clear();
  }
  return 0;
}
