var
f: text;
n,m,i,j: byte;
labirint: array [0..11,0..11] of byte;
position_x, position_y, napravlenie: byte;
tupik: boolean;

procedure vychod;
var flag: boolean;
begin
  labirint[position_x, position_y]:=2;
  if not ((position_x=n) and (position_y=m)) then
  begin
    flag:=false;
    napravlenie:=(napravlenie + 3) mod 4;
    while not flag do
    begin
      case napravlenie of
       0: if labirint[position_x, position_y+1]<>0 then
          begin
           inc(position_y);
           vychod;
           flag:=true
          end;

       1: if labirint[position_x+1, position_y]<>0 then
          begin
           inc(position_x);
           vychod;
           flag:=true
          end;

       2: if labirint[position_x, position_y-1]<>0 then
          begin
           dec(position_y);
           vychod;
           flag:=true
          end;

       3: if labirint[position_x-1, position_y]<>0 then
          begin
           dec(position_x);
           vychod;
           flag:=true
          end;
      end;
      napravlenie:=(napravlenie + 1) mod 4;
    end;
  end;
end;

procedure vychod2;
var flag: boolean;
begin
  labirint[position_x, position_y]:=3;
  if not ((position_x=n) and (position_y=m)) then
  begin
    flag:=false;
    napravlenie:=(napravlenie + 1) mod 4;
    while not flag do
    begin
      case napravlenie of
       0: if labirint[position_x, position_y+1]=2 then
          begin
           inc(position_y);
           vychod2;
           flag:=true
          end;

       1: if labirint[position_x+1, position_y]=2 then
          begin
           inc(position_x);
           vychod2;
           flag:=true
          end;

       2: if labirint[position_x, position_y-1]=2 then
          begin
           dec(position_y);
           vychod2;
           flag:=true
          end;

       3: if labirint[position_x-1, position_y]=2 then
          begin
           dec(position_x);
           vychod2;
           flag:=true
          end;
      end;
      napravlenie:=(napravlenie + 1) mod 4;
    end;
  end;
end;

begin
  assign(f,'labirint.txt');
  reset(f);
  readln(f,n,m);
  for i:=1 to n do
  begin
    for j:=1 to m do
      read(f,labirint[i,j]);
    readln(f);
  end;
  for j:=0 to m+1 do
   begin labirint[0,j]:=0;labirint[n+1,j]:=0 end;
  for i:=1 to n do
   begin labirint[0,j]:=0;labirint[n+1,j]:=0 end;

  for i:=1 to n do
  begin
    for j:=1 to m do
      write(labirint[i,j]);
    writeln;
  end;
  writeln;


  position_x:=1;
  position_y:=1;
  napravlenie:=0;
  vychod;

  for i:=1 to n do
  begin
    for j:=1 to m do
      write(labirint[i,j]);
    writeln;
  end;
  writeln;

  position_x:=1;
  position_y:=1;
  napravlenie:=0;
  vychod2;

  for i:=1 to n do
  begin
    for j:=1 to m do
      write(labirint[i,j]);
    writeln;
  end;


  readln;
end.

4 6
1 0 1 0 1 1
1 0 1 1 1 0
1 1 1 0 1 1
0 0 1 1 0 1