No tag edit access

D. Largest Submatrix 3

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given matrix *a* of size *n* × *m*, its elements are integers. We will assume that the rows of the matrix are numbered from top to bottom from 1 to *n*, the columns are numbered from left to right from 1 to *m*. We will denote the element on the intersecting of the *i*-th row and the *j*-th column as *a*_{ij}.

We'll call submatrix *i*_{1}, *j*_{1}, *i*_{2}, *j*_{2} (1 ≤ *i*_{1} ≤ *i*_{2} ≤ *n*; 1 ≤ *j*_{1} ≤ *j*_{2} ≤ *m*) such elements *a*_{ij} of the given matrix that *i*_{1} ≤ *i* ≤ *i*_{2} AND *j*_{1} ≤ *j* ≤ *j*_{2}. We'll call the area of the submatrix number (*i*_{2} - *i*_{1} + 1)·(*j*_{2} - *j*_{1} + 1). We'll call a submatrix inhomogeneous, if all its elements are distinct.

Find the largest (in area) inhomogenous submatrix of the given matrix.

Input

The first line contains two integers *n*, *m* (1 ≤ *n*, *m* ≤ 400) — the number of rows and columns of the matrix, correspondingly.

Each of the next *n* lines contains *m* integers *a*_{ij} (1 ≤ *a*_{ij} ≤ 160000) — the elements of the matrix.

Output

Print a single integer — the area of the optimal inhomogenous submatrix.

Examples

Input

3 3

1 3 1

4 5 6

2 6 1

Output

6

Input

3 4

5 2 3 1

3 3 5 3

4 4 4 5

Output

4

Input

2 6

1 2 3 4 5 6

8 6 7 8 9 1

Output

8

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/23/2017 16:45:57 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|