#include <bits/stdc++.h>
using namespace std;
char s[200005];
int sum[2][200005];
int mm[4][200005];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%s", s + 1);
    int n = strlen(s + 1);
    for (int i = 1; i <= n; i++) {
      sum[0][i] = sum[0][i - 1];
      sum[1][i] = sum[1][i - 1];
      if (s[i] == 'W') {
        sum[0][i]++;
      } else if (s[i] == 'S') {
        sum[0][i]--;
      } else if (s[i] == 'A') {
        sum[1][i]--;
      } else {
        sum[1][i]++;
      }
    }
    mm[0][n] = mm[1][n] = sum[0][n];
    mm[2][n] = mm[3][n] = sum[1][n];
    int xmi = min(0, sum[1][n]), ymi = min(0, sum[0][n]),
        xma = max(0, sum[1][n]), yma = max(0, sum[0][n]);
    for (int i = n - 1; i >= 0; i--) {
      xmi = min(xmi, sum[1][i]);
      ymi = min(ymi, sum[0][i]);
      xma = max(xma, sum[1][i]);
      yma = max(yma, sum[0][i]);
      mm[0][i] = min(sum[0][i], mm[0][i + 1]);
      mm[1][i] = max(sum[0][i], mm[1][i + 1]);
      mm[2][i] = min(sum[1][i], mm[2][i + 1]);
      mm[3][i] = max(sum[1][i], mm[3][i + 1]);
    }
    int w = xma - xmi + 1, h = yma - ymi + 1;
    int ans1 = 2000000, ans2 = 2000000;
    long long ans = 1e18;
    xmi = ymi = xma = yma = 0;
    for (int i = 1; i <= n; i++) {
      xmi = min(xmi, sum[1][i]);
      ymi = min(ymi, sum[0][i]);
      xma = max(xma, sum[1][i]);
      yma = max(yma, sum[0][i]);
      ans1 = 2000000, ans2 = 2000000;
      ans2 = min(ans2, max(xma, mm[3][i] - 1) - min(xmi, mm[2][i] - 1) + 1);
      ans1 = min(ans1, max(yma, mm[1][i] - 1) - min(ymi, mm[0][i] - 1) + 1);
      ans2 = min(ans2, max(xma, mm[3][i] + 1) - min(xmi, mm[2][i] + 1) + 1);
      ans1 = min(ans1, max(yma, mm[1][i] + 1) - min(ymi, mm[0][i] + 1) + 1);
      ans = min(ans, min((long long)ans1 * w, (long long)ans2 * h));
    }
    printf("%lld\n", ans);
  }
  return 0;
}
