{$A+,B-,D+,E+,F-,G-,I+,L+,N-,O-,P-,Q-,R-,S+,T-,V+,X+}
{$M 16384,0,655360}
uses crt;
var
t,t1:text;
g,m,c,n,i,k,j:integer;
a:array[1..3,1..16] of integer;
max,d:array [1..99] of integer;
begin
clrscr;
assign(t,'profit.dat');
reset(t);
read(t,n);
read(t,m);
for i:=1 to n do
for j:=1 to m do
read(t,a[i,j]);
for i:=1 to n do
for j:=1 to m do
if (a[i,j]>a[i+j,j])and(a[i,j]>max[i])  then
max[i]:=a[i,j];
for i:=1 to n do
for j:=1 to m do
if (a[i,j]>a[i+j,j])and(a[i,j]>d[i])and(d[i]<max[i])  then
d[i]:=a[i,j];
close(t);
for i:=1 to n do
       BEGIN
if (a[i]+d[i]>a[i+1]+d[i+1]) and (a[i]+d[i+1]>a[i+1]+d[i+1])
and (k+i<=n) then begin
k:=k+i;
g:=a[i]+d[i];
end;

if (a[i]+d[i]<a[i+1]+d[i+1]) and (a[i]+d[i]<a[i+1]+d[i+1])
and (k+i<=n) then begin
k:=k+i;
g:=a[i]+d[i];
end;

if (a[i]+d[i]>a[i+1]+d[i+1]) and (a[i]+d[i+1]>a[i+1]+d[i+1])
and (k+i<=n) then begin
k:=k+i;
g:=a[i]+d[i];
end;
END;
assign(t1,'profit.res');
rewrite(t1);
write(t1,g);
close(t1);
end.