1 program lyd1057;
 2 var a:array[0..2000,0..2000]of 0..1;
 3     f:array[0..2000,0..2000]of longint;
 4     s:array[0..2000,0..2000]of longint;
 5     z:array[0..2000]of longint;
 6     l,r,p:array[0..2000]of longint;
 7     ans1,ans2,i,j,m,n,k,t:longint;
 8 function max(a,b:longint):longint;
 9 begin
10     if a>b then exit(a)
11     else exit(b);
12 end;
13 function min(a,b:longint):longint;
14 begin
15     if a<b then exit(a)
16     else exit(b);
17 end;
18 procedure dp(o:longint);
19 var i,j:longint;
20 begin
21     for i:=1 to n do
22       if a[1,i]=o then s[1,i]:=1;
23     for i:=2 to m do
24       for j:=1 to n do
25         if a[i,j]=o then s[i,j]:=s[i-1,j]+1
26         else s[i,j]:=0;
27     for i:=1 to m do
28       for j:=1 to n do
29       begin
30           if a[i,j]=o then f[i,j]:=min(f[i-1,j-1],min(f[i-1,j],f[i,j-1]))+1
31           else f[i,j]:=0;
32           ans1:=max(ans1,f[i,j]);
33       end;
34     for i:=1 to m do
35     begin
36         fillchar(l,sizeof(l),0);
37         fillchar(r,sizeof(r),0);
38         t:=0;
39         for j:=1 to n do
40         begin
41             while (t>0)and(s[i,j]<s[i,z[t]]) do
42             begin
43                 r[z[t]]:=j-z[t];
44                 dec(t);
45             end;
46             if a[i,j]=o then
47             begin
48                 inc(t);
49                 z[t]:=j;
50             end;
51         end;
52         for j:=t downto 1 do
53           r[z[j]]:=n-z[j]+1;
54         t:=0;
55         for j:=n downto 1 do
56         begin
57             while (t>0)and(s[i,j]<s[i,z[t]]) do
58             begin
59                 l[z[t]]:=z[t]-j;
60                 dec(t);
61             end;
62             if a[i,j]=o then
63             begin
64                 inc(t);
65                 z[t]:=j;
66             end;
67         end;
68         for j:=t downto 1 do
69           l[z[j]]:=z[j];
70         for j:=1 to n do
71           if a[i,j]=o then
72           begin
73               p[j]:=l[j]+r[j]-1;
74               ans2:=max(ans2,p[j]*s[i,j]);
75           end;
76     end;
77 end;
78 begin
79     readln(m,n);
80     for i:=1 to m do
81       for j:=1 to n do
82       begin
83           read(a[i,j]);
84           if (i+j)and 1=0 then a[i,j]:=1-a[i,j];
85       end;
86     dp(0);
87     dp(1);
88     ans1:=sqr(ans1);
89     writeln(ans1);
90     writeln(ans2);
91 end.