#include <bits/stdc++.h>
using namespace std;
bool ok(vector<long long> v) {
  int n = v.size();
  for (int i = 0; i < n; ++i) v[i] = 2 * v[i] - 1;
  int x = 0;
  int mi = 0;
  int ma = 0;
  for (int i = 0; i < n; ++i) {
    x += v[i];
    if (mi > x) mi = x;
    if (ma < x) ma = x;
  }
  if (ma - mi < 2) return false;
  vector<long long> u(2, 0);
  x = 0;
  int i = 0;
  while (x != ma && x != mi) {
    x += v[i];
    ++i;
  }
  int fi = x;
  int se = mi + ma - fi;
  while (x != se) {
    x += v[i];
    ++i;
  }
  while (i < n) {
    x += v[i];
    ++i;
    if (x == fi) return false;
  }
  return true;
}
long long f(vector<long long> v) {
  int n = v.size();
  for (int i = 0; i < n; ++i) v[i] = 2 * v[i] - 1;
  int x = 0;
  int mi = 0;
  int ma = 0;
  for (int i = 0; i < n; ++i) {
    x += v[i];
    if (mi > x) mi = x;
    if (ma < x) ma = x;
  }
  return ma - mi + 1;
}
long long solve() {
  string s;
  cin >> s;
  int n = s.length();
  vector<long long> v(n);
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'W') v[i] = 0;
    if (s[i] == 'S') v[i] = 1;
    if (s[i] == 'D') v[i] = 2;
    if (s[i] == 'A') v[i] = 3;
  }
  vector<long long> a, b;
  for (int i = 0; i < n; ++i) {
    if (v[i] < 2)
      a.push_back(v[i]);
    else
      b.push_back(v[i] - 2);
  }
  long long lenx = f(b);
  long long leny = f(a);
  long long res = lenx * leny;
  if (ok(b)) res = min(res, (lenx - 1) * leny);
  if (ok(a)) res = min(res, lenx * (leny - 1));
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) cout << solve() << "\n";
  return 0;
}
