//棋盘制作 (ZJOI2007)

 //悬线法 矩形DP

 #include<stdio.h>

 #include<algorithm>

 using namespace std;

 const int maxn=;

 int H[maxn][maxn];

 int L[maxn][maxn];

 int R[maxn][maxn];

 bool map[maxn][maxn];

 int N,M;

 int ans1;

 int ans2;

 int main()

 {

     scanf("%d %d",&N,&M);

     for(int i=;i<=N;i++)

     {

         for(int j=;j<=M;j++)

         {

             int x;

             scanf("%d",&x);

             map[i][j]=x;

             if(i==)H[i][j]=;

             else if(map[i][j]!=map[i-][j])H[i][j]=H[i-][j]+;

             else H[i][j]=;

         }

     }

     for(int i=;i<=N;i++)

     {

         for(int j=;j<=M;j++)

         {

             L[i][j]=j;

             while(L[i][j]>&&map[i][L[i][j]-]!=map[i][L[i][j]]&&H[i][L[i][j]-]>=H[i][j])

             {

                 L[i][j]=L[i][L[i][j]-];

             }

         }

         for(int j=M;j>=;j--)

         {

             R[i][j]=j;

             while(R[i][j]<M&&map[i][R[i][j]+]!=map[i][R[i][j]]&&H[i][R[i][j]+]>=H[i][j])

             {

                 R[i][j]=R[i][R[i][j]+];

             }

         }

         for(int j=;j<=M;j++)

         {

             int dx=R[i][j]-L[i][j]+;

             int dy=H[i][j];

             ans1=max(ans1,dx*dy);

             ans2=max(ans2,min(dx,dy)*min(dx,dy));

         }

     }

     printf("%d\n%d",ans2,ans1);

 }