program veze;
{prgram na nalezeni nejkratsi cesty ze zadaneho policka
na zadane policko, jsou-li na sachovnici zakazana pole}
const N=8; {pocet poli sachovnice}
      K=9;
      PocetPrekazek=8;
var m, i : integer;
    x,y,prekazek: integer;
    vstup, vystup:text;
    start1,start2,cil1,cil2:integer;
    pole: array[1..N,1..K] of integer;
    krok,z1,z2:integer;
    sour1,sour2,tahu:integer;




begin
 assign(vstup,'veze.txt');
 reset(vstup);
 readln(vstup,start1,start2,cil1,cil2);
 assign(vystup,'tahvezi.txt');
 rewrite(vystup);

 for i:=1 to N do
    for m:=1 to K do
        pole[i,m]:=-1;



 pole[start1,start2]:=0;

 prekazek:=0;
 while prekazek <> PocetPrekazek do begin
 readln(vstup,x,y);
 pole[x,y]:=-2;
 prekazek:=prekazek+1;
 end;

  close(vstup);




 krok:=1;

 while pole[cil1,cil2]=-1 do

  begin

   for i:=1 to N do
     for m:=1 to K do
      if pole[i,m]= krok-1 then
      begin

       for z1:=i+1 to N do
       if pole[z1,m]=-1 then  begin
        pole[z1,m]:=krok;
        end
        else if pole[z1,m]=-2 then break;

       for z1:=i-1 downto 1 do
        if pole[z1,m]=-1 then  begin
        pole[z1,m]:=krok;
        end
        else if pole[z1,m]=-2 then break;



       for z2:=m+1 to K do
       if pole[i,z2]=-1 then begin
        pole[i,z2]:=krok;
        end
        else if pole[i,z2]=-2 then break;

       for z2:=m-1 downto 1 do
        if pole[i,z2]=-1 then begin
        pole[i,z2]:=krok;
        end
        else if pole[i,z2]=-2 then break;
      end;

     krok:=krok+1

  end;


{assign(vystup,'tahvezi.txt');
rewrite(vystup);}
for i:=1 to N do
   begin for m:=1 to K do
           begin if ((i=cil1) and (m=cil2)) then
                      write (vystup, 'C':3)
                   else if (i=start1) and (m=start2) then write (vystup, 'S':3)
                        else write (vystup, pole[i,m]:3);
           end;

         writeln (vystup);
   end;

writeln(vystup,'Tah',' ','vezi',' ','v',' ','obracenem',' ','poradi',':');
write(vystup,'(',cil1,',',cil2,')');


z1:=cil1;
z2:=cil2;
sour1:=cil1;
sour2:=cil2;


tahu:=pole[cil1,cil2];

repeat


   while (pole[z1,z2]=tahu)and(z1<N) do
   begin
   z1:=z1+1;
   end;

    if pole[z1,z2]=tahu-1 then
    begin
    write(vystup,'(',z1,',',z2,')') ;

   sour1:=z1;
    tahu:=tahu-1;
    end

  else begin z1:=sour1;z2:=sour2;

    while (pole[z1,z2]=tahu) and (z1>1) do  begin
     z1:=z1-1;end;

    if (pole[z1,z2]=tahu-1)and (tahu>0) then
    begin
    write(vystup,'(',z1,',',z2,')');
    sour1:=z1; ;
    tahu:=tahu-1
    end


     else begin z1:=sour1;z2:=sour2;
   while (pole[z1,z2]=tahu) and (z2<K) do begin
   z2:=z2+1; end;

    if (pole[z1,z2]=tahu-1)and (tahu>0) then
    begin
    write(vystup,'(',z1,',',z2,')');

    sour2:=z2;
    tahu:=tahu-1;
    end

    else begin z1:=sour1;z2:=sour2;


 {for i:=z2+1 to N do
 begin               }

    while (pole[z1,z2]=tahu)and (z2>1) do
   begin
   z2:=z2-1
   end;


    if (pole[z1,z2]=tahu-1)and (tahu>0) then
    begin
    write(vystup,'(',z1,',',z2,')');

    sour2:=z2;
    tahu:=tahu-1;
    end;

 end;
 end;
 end;

 until tahu=0;
 close(vystup);
 end.
