#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool uin(T& a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
inline bool uax(T& a, T b) {
  return a < b ? (a = b, true) : false;
}
const int nax = 2e5 + 10;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
int xp[nax], yp[nax], xin[nax], xax[nax], yin[nax], yax[nax];
void solve() {
  string S;
  cin >> S;
  int N = (int)S.length();
  int x = 0, y = 0;
  for (int i = 0; i < N; ++i) {
    if (S[i] == 'A') --x;
    if (S[i] == 'D') ++x;
    if (S[i] == 'W') ++y;
    if (S[i] == 'S') --y;
    xp[i + 1] = x;
    yp[i + 1] = x;
    xin[i + 1] = min(xin[i], x);
    xax[i + 1] = max(xax[i], x);
    yin[i + 1] = min(yin[i], y);
    yax[i + 1] = max(yax[i], y);
  }
  long long area = (xax[N] - xin[N] + 1) * 1LL * (yax[N] - yin[N] + 1);
  int max_x = x, min_x = x, max_y = y, min_y = y;
  for (int i = N - 1; i >= 0; --i) {
    if (S[i] == 'W') --y;
    if (S[i] == 'A') ++x;
    if (S[i] == 'S') ++y;
    if (S[i] == 'D') --x;
    uax(max_x, x);
    uax(max_y, y);
    uin(min_x, x);
    uin(min_y, y);
    for (int j = 0; j < 4; ++j) {
      long long xx =
          max(xax[i] + dx[j], max_x) - min(xin[i] + dx[j], min_x) + 1LL;
      long long yy =
          max(yax[i] + dy[j], max_y) - min(yin[i] + dy[j], min_y) + 1LL;
      uin(area, xx * yy);
    }
  }
  cout << area << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) solve();
}
