#include <bits/stdc++.h>
using namespace std;
inline void showVec(vector<int> &vec) {
  for (int v : vec) cout << v << " ";
  cout << endl;
}
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  vector<pair<int, int> > lrp(n + 2), udp(n + 2);
  vector<pair<int, int> > lrs(n + 2), uds(n + 2);
  vector<int> hd(n + 2), vd(n + 2);
  for (int i = 1; i <= n; ++i) {
    hd[i] = hd[i - 1], vd[i] = vd[i - 1];
    if (s[i - 1] == 'D')
      hd[i]++;
    else if (s[i - 1] == 'A')
      hd[i]--;
    else if (s[i - 1] == 'W')
      vd[i]++;
    else
      vd[i]--;
    lrp[i].first = min(lrp[i - 1].first, hd[i]);
    lrp[i].second = max(lrp[i - 1].second, hd[i]);
    udp[i].first = max(udp[i - 1].first, vd[i]);
    udp[i].second = min(udp[i - 1].second, vd[i]);
  }
  for (int i = n; i; --i) {
    lrs[i] = lrs[i + 1], uds[i] = uds[i + 1];
    if (s[i - 1] == 'D')
      lrs[i].first--, lrs[i].second++;
    else if (s[i - 1] == 'A')
      lrs[i].first++, lrs[i].second--;
    else if (s[i - 1] == 'W')
      uds[i].first++, uds[i].second--;
    else
      uds[i].first--, uds[i].second++;
    if (lrs[i].first < 0) lrs[i].first = 0;
    if (lrs[i].second < 0) lrs[i].second = 0;
    if (uds[i].first < 0) uds[i].first = 0;
    if (uds[i].second < 0) uds[i].second = 0;
  }
  int w = lrp[n].second - lrp[n].first + 1;
  for (int i = 1; i <= n; ++i) {
    int l = min(lrp[i].first, hd[i] + 1 - lrs[i + 1].first);
    int r = max(lrp[i].second, hd[i] + 1 + lrs[i + 1].second);
    w = min(w, r - l + 1);
  }
  for (int i = 1; i <= n; ++i) {
    int l = min(lrp[i].first, hd[i] - 1 - lrs[i + 1].first);
    int r = max(lrp[i].second, hd[i] - 1 + lrs[i + 1].second);
    w = min(w, r - l + 1);
  }
  int h = udp[n].first - udp[n].second + 1;
  for (int i = 1; i <= n; ++i) {
    int u = max(udp[i].first, vd[i] + 1 + uds[i + 1].first);
    int d = min(udp[i].second, vd[i] + 1 - uds[i + 1].second);
    h = min(h, u - d + 1);
  }
  for (int i = 1; i <= n; ++i) {
    int u = max(udp[i].first, vd[i] - 1 + uds[i + 1].first);
    int d = min(udp[i].second, vd[i] - 1 - uds[i + 1].second);
    h = min(h, u - d + 1);
  }
  cout << min(w * 1ll * (udp[n].first - udp[n].second + 1),
              (lrp[n].second - lrp[n].first + 1) * 1ll * h)
       << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
