Program Lab; Uses Crt;
const maxn=30;
      dx:array[1..4] of integer=(-1,0,1,0);
      dy:array[1..4] of integer=(0,-1,0,1);
var   A:array[1..maxn+1, 1..maxn+1] of integer;
      n,m,
      sx,sy,
      fx,fy:integer;
      F:text;
      OK:boolean;
     procedure Initializare;
      var
       i,j:integer;
        begin
         for i:=0 to maxn+1 do
          for j:=0 to maxn+1 do
           a[i,j]:=1;
             write('Dati n si m: ');
              readln(n,m);
             for i:=1 to n do
               for j:=1 to m do         begin
                write('a[',i,',',j,']=');
                 readln(a[i,j]);
          writeln;
         end;
             write('Dati coordonatele punctului A: '); readln(sx,sy);
             write('Dati coordonatele punctului B: '); readln(fx,fy);
         readln;
      end; {Init}
      procedure Search(x,y,k:integer);
       var
         i:integer;
          begin
            OK:=True;
            if (x=fx) and (y=fy) then
              begin
               writeln('DA, drum exista');
               OK:=False;
               readln;
               Halt;
            end
              else
               for i:=1 to 4 do
                if a[y+dy[i], x+dx[i]]=0 then
                  Search(x+dx[i], y+dy[i], k+1);
          end;
 Begin ClrScr;
  Initializare;
   search(sx,sy,1);
 if OK then writeln('NU exista drum');
 readln;
 end.