Problem: 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.

Examples

Input

3 3
..#
##.
.#.


Output

6


Input

3 3
..#
.
.#.


Output

6


Input

4 4
....
....
....
....


Output

16


Input

10 8
...#.#
...#.#
..###.#.
.##.#.#
.#..#.#.
..##.#.#
.#.#..
...#.#..
.#.##
..###


Output

27

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
char s[N][N];
int up[N][N][2][2], a[N][N], b[N], las[N], L[N], R[N];
int solve(int n) {
	vector<int> q;
	q.push_back(0);
	b[0] = b[n + 1] = 0;
	for (int i = 1; i <= n; ++ i) {
		while (b[q.back()] >= b[i]) q.pop_back();
		L[i] = q.back();
		q.push_back(i);
	}
	q.clear();
	q.push_back(n + 1);
	for (int i = n; i >= 1; -- i) {
		while (b[q.back()] >= b[i]) q.pop_back();
		R[i] = q.back();
		q.push_back(i);
	}
	int ans = 0;
	for (int i = 1; i <= n; ++ i) ans = max(ans, b[i] * (R[i] - L[i]));
	return ans;
}
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++ i) {
		scanf("%s", s[i] + 1);
		for (int j = 1; j <= m; ++ j) a[i][j] = s[i][j] == '#';
	}
	for (int i = 1; i <= n; ++ i) {
		for (int j = 2; j <= m; ++ j) {
			for (int x = 0; x < 2; ++ x) {
				for (int y = 0; y < 2; ++ y) {
					up[i][j][x][y] = (a[i][j] ^ x) != (a[i][j - 1] ^ y) ? 0 : up[i - 1][j][x][y] + 1;
				}
			}
		}
	}
	int ans = n;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 2; j <= m; ++ j) {
			b[j - 1] = up[i - 1][j][a[i][j]][a[i][j - 1]] + 1;
		}
		ans = max(ans, solve(m - 1));
	}
	printf("%d\n", ans);
}