#include <bits/stdc++.h>
using ll = long long;
using namespace std;
long long f(vector<long long> arr, long long depth = 1) {
  vector<long long> pref = arr;
  for (long long i = 1; i < arr.size(); i++) {
    pref[i] += pref[i - 1];
  }
  long long mx = 0, mn = 0;
  for (auto x : pref) {
    mx = max(mx, x);
    mn = min(mn, x);
  }
  long long ind = 0;
  for (long long i = 0; i < arr.size(); i++) {
    if (pref[i] == mx) {
      ind = i;
      break;
    }
  }
  if (depth == 0) {
    return mx + abs(mn) + 1;
  }
  vector<long long> na;
  for (long long i = 0; i < ind; i++) {
    na.push_back(arr[i]);
  }
  na.push_back(-1);
  for (long long i = ind; i < arr.size(); i++) na.push_back(arr[i]);
  return f(na, 0);
}
void sol() {
  string s;
  cin >> s;
  vector<long long> x, y;
  for (auto el : s) {
    if (el == 'W') {
      y.push_back(1);
    } else if (el == 'S') {
      y.push_back(-1);
    } else if (el == 'A') {
      x.push_back(-1);
    } else {
      x.push_back(1);
    }
  }
  long long n = f(x, 0), m = f(y, 0);
  long long n1 = f(x), m1 = f(y);
  for (auto &el : x) {
    el *= -1;
  }
  for (auto &el : y) {
    el *= -1;
  }
  n1 = min(n1, f(x));
  m1 = min(m1, f(y));
  cout << min(n1 * m, n * m1) << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long t;
  cin >> t;
  while (t--) {
    sol();
  }
}
