We have a board with an H \times W grid.
Each square in the grid is painted in black or white. The square at the i-th row from the top and j-th column from the left is black if the j-th character in S_i is #, and white if that character is ..
Snuke can perform the following operation on the grid any number of times:
 - Select a row or column in the grid, and invert the color of all the squares in that row or column (that is, black squares become white and vice versa).
Then, Snuke draws a rectangle along grid lines. Here, all the squares contained in the rectangle must be painted in black.
Find the maximum possible area of Snuke's rectangle when the operation is performed optimally.

-----Constraints-----
 - 2 \leq H \leq 2000
 - 2 \leq W \leq 2000
 - |S_i| = W
 - S_i consists of # and ..

-----Input-----
Input is given from Standard Input in the following format:
H W
S_1
S_2
:
S_H

-----Output-----
Print the maximum possible area of Snuke's rectangle.

-----Sample Input-----
3 3
..#
##.
.#.

-----Sample Output-----
6

If the first row from the top and the third column from the left are inverted, a 2 \times 3 rectangle can be drawn, as shown below:

```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 = "import sys\ninput = sys.stdin.readline\nfrom collections import deque\n\nh,w = map(int,input().split())\ns = []\nfor i in range(h):\n  q = input().rstrip()\n  s.append(q)\n\nchk = [[0]*(w-1) for i in range(h-1)]\nfor i in range(w-1):\n  for j in range(h-1):\n    chk[j][i] = 1-int((s[j][i]=='#')^(s[j+1][i]=='#')^(s[j][i+1]=='#')^(s[j+1][i+1]=='#'))\n\ndef f(a):\n  a += [0]\n  stack = deque()\n  ans = -1\n  for i in range(w):\n    if stack == deque():\n        stack.append((a[i], i))\n    elif stack[-1][0] < a[i]:\n        stack.append((a[i], i))\n    elif stack[-1][0] > a[i]:\n      while stack and stack[-1][0] >= a[i]:\n        x, y = stack.pop()\n        ans = max((x+1)*(i-y+1), ans)\n      stack.append((a[i], y))\n  return ans\n  \ndp = [[0]*(w-1) for i in range(h-1)]\nfor i in range(w-1):\n  dp[0][i] = chk[0][i]\n  \nfor i in range(1,h-1):\n  for j in range(w-1):\n    if chk[i][j]:\n      dp[i][j] = dp[i-1][j]+1\n\nans=max(h,w)\nfor i in range(h-1):\n    ans=max(ans,f(dp[i]))\n    \nprint(ans)"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14365