#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 const int N=,Inf=(int)1e9;

 int n,m,a1,a2;

 int a[N][N],l[N][N],r[N][N],last[N][N],cl[N][N],cr[N][N];

 int minn(int x,int y){return x<y ? x:y;}

 int maxx(int x,int y){return x>y ? x:y;}

 void add(int x,int y,int d)

 {

     for(int i=y;i<=m;i+=(i&(-i))) cl[x][i]=maxx(cl[x][i],d);

     for(int i=y;i>=;i-=(i&(-i))) cr[x][i]=minn(cr[x][i],d);

 }

 int get(int x,int y,int tmp)

 {

     if(tmp==)

     {

         int ans=;

         for(int i=y-;i>=;i-=(i&(-i))) ans=maxx(ans,cl[x][i]);

         if(ans==) return ;

         else return ans+;

     }

     else

     {

         int ans=Inf;

         for(int i=y+;i<=m;i+=(i&(-i))) ans=minn(ans,cr[x][i]);

         if(ans>=Inf) return m;

         else return ans-;

     }

 }

 void solve(int tmp)

 {

     memset(cl,,sizeof(cl));

     memset(cr,,sizeof(cr));

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

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

         {

             if(a[i][j]==tmp) add(i,j,j);

         }

     memset(l[],,sizeof(l[]));

     memset(r[],,sizeof(r[]));

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

     {

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

         {

             if(a[i][j]==tmp) continue;

             if(a[i-][j]==tmp)

             {

                 l[i][j]=get(i,j,);//debug

                 r[i][j]=get(i,j,);//debug

                 last[i][j]=i-;

             }

             else

             {

                 l[i][j]=maxx(l[i-][j],get(i,j,));

                 r[i][j]=minn(r[i-][j],get(i,j,));

                 last[i][j]=last[i-][j];

             }

             int xx=r[i][j]-l[i][j]+;

             int yy=i-last[i][j];

             a1=maxx(a1,minn(xx,yy)*minn(xx,yy));

             a2=maxx(a2,xx*yy);

         }

     }

 }

 int main()

 {

     freopen("a.in","r",stdin);

     scanf("%d%d",&n,&m);

     a1=;a2=;

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

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

         {

             scanf("%d",&a[i][j]);

             if((i+j)%==) a[i][j]^=;

         }

     solve();

     solve();

     printf("%d\n%d\n",a1,a2);

     return ;

 }