Program numbers;
Const Maxn=50;
Maxm=9;
Var h:array[1..Maxn] of Integer;
g:array[1..Maxn,1..Maxn] of LongInt;
Fmin,Fmax:array[1..Maxn,1..Maxm] Of Longint;
n,m,i,j,k,l:Integer;
Max,Min,Tmax,Tmin,s:Longint;
fi,fo:String;
Procedure readfile;
Begin
Write('Input File Name:'); Readln(fi);
Write('Output FIle Name:'); Readln(fo);
Assign(Input,fi); Assign(Output,fo);
Reset(Input); Rewrite(Output);
Readln(n,m);
For i:=1 to n do
Readln(h);
Close(Input);
End;
Procedure init;
Begin
For i:=1 to n do
For j:=i to n do
Begin
s:=0;
For k:=i to j do s:=s+h[k];
s:=s mod 10;
If s<0 Then s:=10+s;
g[i,j]:=s;
End;
For i:=1 to n do
For j:=1 to m do
Begin Fmin[i,j]:=1; Fmax[i,j]:=1 End;
For i:=1 to n do
Begin
Fmin[i,1]:=g[1,i]; Fmax[i,1]:=g[1,i]
End
End;
Procedure move;
Var temp,p:Integer;
Begin
temp:=h[1];
For p:=1 to n-1 do
h[p]:=h[p+1];
h[n]:=temp;
End;
Procedure solute;
Begin
Max:=-Maxint; Min:=Maxint;
For l:=1 to n do
Begin
Init;
For i:=2 to n do
For j:=2 to m do
Begin
Tmax:=-Maxint;
Tmin:=Maxint;
For k:=j-1 to i-1 do
Begin
If TMax<Fmax[k,j-1]*g[k+1,i] Then Tmax:=Fmax[k,j-1]*g[k+1,i];
If TMin>Fmin[k,j-1]*g[k+1,i] Then Tmin:=Fmin[k,j-1]*g[k+1,i];
End;
Fmax[i,j]:=Tmax; Fmin[i,j]:=Tmin;
End;
If Max<Fmax[n,m] Then Max:=Fmax[n,m];
If Min>Fmin[n,m] Then Min:=Fmin[n,m];
move;
End;
End;
Procedure Print;
Begin
Writeln(Min);
Writeln(Max);
close(output);
End;
Begin
Readfile;
Solute;
Print
End.
