#include <bits/stdc++.h>
using namespace std;
int main() {
  int q;
  cin >> q;
  long long int results[q];
  for (int j = 0; j < q; j++) {
    long long int leftSway = 0, leftMax = 0, rightMax = 0, upSway = 0,
                  upMax = 0, downMax = 0;
    string s;
    cin >> s;
    int a = INT_MAX, b = INT_MAX;
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == 'A') leftSway++;
      if (s[i] == 'D') leftSway--;
      leftMax = max(leftMax, leftSway);
      rightMax = min(rightMax, leftSway);
      if (s[i] == 'W') upSway++;
      if (s[i] == 'S') upSway--;
      upMax = max(upMax, upSway);
      downMax = min(downMax, upSway);
    }
    results[j] = (leftMax - rightMax + 1) * (upMax - downMax + 1);
    if (leftMax - rightMax + 1 >= 3) {
      int firstMin = -1, lastMin = -1, firstMax = -1, lastMax = -1;
      int l = 0;
      for (int i = 0; i < s.size(); i++) {
        if (s[i] == 'A') l++;
        if (s[i] == 'D') l--;
        if (firstMin == -1 && rightMax == l) {
          firstMin = i;
        }
        if (rightMax == l) {
          lastMin = i;
        }
        if (firstMax == -1 && leftMax == l) {
          firstMax = i;
        }
        if (leftMax == l) {
          lastMax = i;
        }
      }
      if (firstMax > lastMin && leftMax != 0) {
        results[j] = (leftMax - rightMax) * (upMax - downMax + 1);
      }
      if (lastMax < firstMin && rightMax != 0) {
        results[j] = (leftMax - rightMax) * (upMax - downMax + 1);
      }
    }
    if (upMax - downMax + 1 >= 3) {
      int firstMin = -1, lastMin = -1, firstMax = -1, lastMax = -1;
      int l = 0, u = 0;
      for (int i = 0; i < s.size(); i++) {
        if (s[i] == 'W') u++;
        if (s[i] == 'S') u--;
        if (firstMin == -1 && downMax == u) {
          firstMin = i;
        }
        if (downMax == u) {
          lastMin = i;
        }
        if (firstMax == -1 && upMax == u) {
          firstMax = i;
        }
        if (upMax == u) {
          lastMax = i;
        }
      }
      if (firstMax > lastMin && upMax != 0) {
        results[j] =
            min(results[j], (leftMax - rightMax + 1) * (upMax - downMax));
      }
      if (lastMax < firstMin && downMax != 0) {
        results[j] =
            min(results[j], (leftMax - rightMax + 1) * (upMax - downMax));
      }
    }
  }
  for (int i = 0; i < q; i++) cout << results[i] << endl;
  return 0;
}
