#include<iostream>
#include<cstdio>
using namespace std;
int n,m,ans1,ans2;
int L[2001][2001],R[2001][2001],UP[2001][2001];
int val[2001][2001];
int main()
{
	freopen("makechess.in","r",stdin);
	freopen("makechess.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			scanf("%d",&val[i][j]);
			L[i][j]=j;
			R[i][j]=j;
			UP[i][j]=1;
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=2;j<=m;j++)
		{
			if(val[i][j]!=val[i][j-1])
			{
				L[i][j]=L[i][j-1];
			}
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=m-1;j>0;j--)
		{
			if(val[i][j]!=val[i][j+1])
			{
				R[i][j]=R[i][j+1];
			}
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(i>1&&val[i][j]!=val[i-1][j])
			{
				L[i][j]=max(L[i][j],L[i-1][j]);
				R[i][j]=min(R[i][j],R[i-1][j]);//
				UP[i][j]=UP[i-1][j]+1;
			}
			int a=R[i][j]-L[i][j]+1;
			int h=min(a,UP[i][j]);
			ans1=max(ans1,h*h);
			ans2=max(ans2,a*UP[i][j]); 
		}
	}
	printf("%d\n%d",ans1,ans2);
	return 0;
}