#include <bits/stdc++.h>
using namespace std;
long long x[200010], y[200010];
long long a[200010], b[200010], c[200010], d[200010];
long long aa[200010], bb[200010], cc[200010], dd[200010];
void solve() {
  string s;
  cin >> s;
  if (s.size() == 1) {
    cout << 2 << endl;
    return;
  }
  x[0] = y[0] = 0;
  for (int i = 0; i < s.size(); i++) {
    x[i + 1] = x[i], y[i + 1] = y[i];
    if (s[i] == 'W') y[i + 1]--;
    if (s[i] == 'S') y[i + 1]++;
    if (s[i] == 'A') x[i + 1]--;
    if (s[i] == 'D') x[i + 1]++;
  }
  a[0] = b[0] = c[0] = d[0] = 0;
  for (int i = 1; i <= s.size(); i++) {
    a[i] = min(a[i - 1], x[i]);
    b[i] = max(b[i - 1], x[i]);
    c[i] = min(c[i - 1], y[i]);
    d[i] = max(d[i - 1], y[i]);
  }
  aa[s.size()] = bb[s.size()] = x[s.size()];
  cc[s.size()] = dd[s.size()] = y[s.size()];
  for (int i = s.size() - 1; i >= 0; i--) {
    aa[i] = min(aa[i + 1], x[i]);
    bb[i] = max(bb[i + 1], x[i]);
    cc[i] = min(cc[i + 1], y[i]);
    dd[i] = max(dd[i + 1], y[i]);
  }
  long long ans = 1e17;
  for (int i = 0; i + 1 <= s.size(); i++) {
    long long dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
    for (int r = 0; r < 4; r++) {
      long long xx = min(a[i], aa[i + 1] + dx[r]);
      xx = min(xx, x[i] + dx[r]);
      long long xxx = max(b[i], bb[i + 1] + dx[r]);
      xxx = max(xxx, x[i] + dx[r]);
      long long yy = min(c[i], cc[i + 1] + dy[r]);
      yy = min(yy, y[i] + dy[r]);
      long long yyy = max(d[i], dd[i + 1] + dy[r]);
      yyy = max(yyy, y[i] + dy[r]);
      ans = min(ans, (xxx - xx + 1) * (yyy - yy + 1));
    }
  }
  cout << ans << endl;
  return;
}
int main() {
  long long q;
  cin >> q;
  while (q--) solve();
  return 0;
}
