P10965 Largest Submatrix

Now here is a matrix with letter 'a','b','c','w','x','y','z' and you can change 'w' to 'a' or 'b', change 'x' to 'b' or 'c', change 'y' to 'a' or 'c', and change 'z' to 'a', 'b' or 'c'. After you changed it, what's the largest submatrix with the same letters you can make?

The input contains multiple test cases. Each test case begins with $m$ and $n (1

For each test case, output one line containing the number of elements of the largest submatrix of all same letters.