#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int INF = 1e9 + 9;
int T;
int n;
string s;
void ReadInput() {
  cin >> s;
  n = s.length();
}
void Solve() {
  int first = 0, second = 0;
  int l = 0, r = 0, up = 0, dw = 0;
  int fl = 0, fr = 0, fup = 0, fdw = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'W') {
      if (++second > up) {
        up = second;
        fdw = 0;
        fup = 1;
      } else if (second == up)
        fup = 1;
    }
    if (s[i] == 'A') {
      if (--first < l) {
        l = first;
        fr = 0;
        fl = 1;
      } else if (first == l)
        fl = 1;
    }
    if (s[i] == 'S') {
      if (--second < dw) {
        dw = second;
        fup = 0;
        fdw = 1;
      } else if (second == dw)
        fdw = 1;
    }
    if (s[i] == 'D') {
      if (++first > r) {
        r = first;
        fl = 0;
        fr = 1;
      } else if (first == r)
        fr = 1;
    }
  }
  first = r - l + 1;
  second = up - dw + 1;
  long long ans = 1LL * first * second, k = ans;
  if (first > 2 && fl * fr == 0) ans = k - second;
  if (second > 2 && fup * fdw == 0 && k - first < ans) ans = k - first;
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> T;
  while (T-- > 0) {
    ReadInput();
    Solve();
  }
}
