You have a string $s$ — a sequence of commands for your toy robot. The robot is placed in some cell of a rectangular grid. He can perform four commands:  'W' — move one cell up;  'S' — move one cell down;  'A' — move one cell left;  'D' — move one cell right. 

Let $Grid(s)$ be the grid of minimum possible area such that there is a position in the grid where you can place the robot in such a way that it will not fall from the grid while running the sequence of commands $s$. For example, if $s = \text{DSAWWAW}$ then $Grid(s)$ is the $4 \times 3$ grid:  you can place the robot in the cell $(3, 2)$;  the robot performs the command 'D' and moves to $(3, 3)$;  the robot performs the command 'S' and moves to $(4, 3)$;  the robot performs the command 'A' and moves to $(4, 2)$;  the robot performs the command 'W' and moves to $(3, 2)$;  the robot performs the command 'W' and moves to $(2, 2)$;  the robot performs the command 'A' and moves to $(2, 1)$;  the robot performs the command 'W' and moves to $(1, 1)$.  [Image] 

You have $4$ extra letters: one 'W', one 'A', one 'S', one 'D'. You'd like to insert at most one of these letters in any position of sequence $s$ to minimize the area of $Grid(s)$.

What is the minimum area of $Grid(s)$ you can achieve?


-----Input-----

The first line contains one integer $T$ ($1 \le T \le 1000$) — the number of queries.

Next $T$ lines contain queries: one per line. This line contains single string $s$ ($1 \le |s| \le 2 \cdot 10^5$, $s_i \in \{\text{W}, \text{A}, \text{S}, \text{D}\}$) — the sequence of commands.

It's guaranteed that the total length of $s$ over all queries doesn't exceed $2 \cdot 10^5$.


-----Output-----

Print $T$ integers: one per query. For each query print the minimum area of $Grid(s)$ you can achieve.


-----Example-----
Input
3
DSAWWAW
D
WA

Output
8
2
4



-----Note-----

In the first query you have to get string $\text{DSAWW}\underline{D}\text{AW}$.

In second and third queries you can not decrease the area of $Grid(s)$.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "t = int(input())\nfor c in range(t):\n    s = input()\n    up_max = down_max = right_max = left_max = 0\n    first_up = last_up = first_down = last_down = first_left = last_left = first_right = last_right = 0\n    current_x = current_y = 0\n    horizontal_count = vertical_count = 0\n    for i in range(len(s)):\n        if s[i] == 'W':\n            current_y += 1\n            vertical_count += 1\n            if current_y > up_max:\n                up_max = current_y\n                first_up = last_up = i + 1\n            elif current_y == up_max:\n                last_up = i + 1\n        elif s[i] == 'S':\n            current_y -= 1\n            vertical_count += 1\n            if current_y < down_max:\n                down_max = current_y\n                first_down = last_down = i + 1\n            elif current_y == down_max:\n                last_down = i + 1\n        elif s[i] == 'D':\n            current_x += 1\n            horizontal_count += 1\n            if current_x > right_max:\n                right_max = current_x\n                first_right = last_right = i + 1\n            elif current_x == right_max:\n                last_right = i + 1\n        else:\n            current_x -= 1\n            horizontal_count += 1\n            if current_x < left_max:\n                left_max = current_x\n                first_left = last_left = i + 1\n            elif current_x == left_max:\n                last_left = i + 1\n\n    h = up_max - down_max + 1\n    w = right_max - left_max + 1\n    ans = h * w\n    if vertical_count > 1 and last_up < first_down:\n        ans = min(ans, (h - 1) * w)\n    if vertical_count > 1 and last_down < first_up:\n        ans = min(ans, (h - 1) * w)\n    if horizontal_count > 1 and last_right < first_left:\n        ans = min(ans, h * (w - 1))\n    if horizontal_count > 1 and last_left < first_right:\n        ans = min(ans, h * (w - 1))\n\n    print(ans)"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13609