Var
   i,j,m,n: longint;
   l: array [0..171, 0..171] of longint;

Procedure busca(x,y,n: longint);
          begin
          writeln(output,y,' ',x);
          if (l[x+1,y]= n+1) then busca(x+1,y,n+1);
          if (l[x-1,y]= n+1) then busca(x-1,y,n+1);
          if (l[x,y+1]= n+1) then busca(x,y+1,n+1);
          if (l[x,y-1]= n+1) then busca(x,y-1,n+1);
          end;

Begin
     readln(input,n,m);
     for j:= 1 to n do
         for i:= 1 to m do
             read(input,l[i,j]);
     for j:= 1 to n do
         for i:= 1 to m do
             if (l[i,j]= 0) then
                busca(i,j,0);
End.