program p_1139;

var a,f:array[0..100,0..500] of int64;

map,father:array[0..100,0..500] of integer;

dui:array[0..3000] of integer;

t1,t2,n,i,j,k,l,m,x,y,ans:longint;

ansf:array[0..500000] of integer;

procedure dfs(posx,posy,level:longint);

begin

if level=0 then

exit;

ansf[level]:=posy;

if father[posx,posy]=posy then

dfs(posx-1,posy,level-1);

if father[posx,posy]posy then

dfs(posx,father[posx,posy],level-1);

end;

begin

readln(m,n);

for i:=1 to m do

begin

for j:=1 to n do

begin

read(a);

f:=f+a;

if i>1 then

father:=j;

map:=map+1;

dui[j]:=j;

end;

for j:=2 to n do

begin

if (f>f+a)or((f=f+a)and(map+1f+a)or((f=f+a)and(map+1