#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int arr[N] = {};
int L[N][4] = {}, R[N][4] = {};
int now[4] = {};
void add(int x) {
  now[x] = max(0, now[x] - 1);
  now[x ^ 3]++;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int T;
  string str;
  cin >> T;
  while (T--) {
    cin >> str;
    int n = str.size();
    memset(L, 0, sizeof(L));
    memset(R, 0, sizeof(R));
    for (int i = 1; i <= n; i++) {
      if (str[i - 1] == 'W') arr[i] = 0;
      if (str[i - 1] == 'D') arr[i] = 1;
      if (str[i - 1] == 'S') arr[i] = 3;
      if (str[i - 1] == 'A') arr[i] = 2;
    }
    now[0] = now[1] = now[2] = now[3] = 0;
    for (int i = 1; i <= n; i++) {
      add(arr[i]);
      for (int j = 0; j < 4; j++) L[i][j] = now[j];
    }
    now[0] = now[1] = now[2] = now[3] = 0;
    for (int i = n; i > 0; i--) {
      add(arr[i] ^ 3);
      for (int j = 0; j < 4; j++) R[i][j] = now[j];
    }
    long long ans = 0x7f7f7f7f7f7f;
    for (int i = 1; i <= n + 1; i++) {
      for (int j = 0; j < 4; j++) {
        int t1 = L[i - 1][j], t2 = L[i - 1][j ^ 3];
        L[i - 1][j]++;
        L[i - 1][j ^ 3] = max(0, L[i - 1][j ^ 3] - 1);
        long long r = max(L[i - 1][0], R[i][0]) + max(L[i - 1][3], R[i][3]) + 1;
        long long c = max(L[i - 1][1], R[i][1]) + max(L[i - 1][2], R[i][2]) + 1;
        ans = min(ans, r * c);
        L[i - 1][j] = t1;
        L[i - 1][j ^ 3] = t2;
      }
    }
    cout << ans << '\n';
  }
  return 0;
}
