#include <stdio.h>
#include <values.h>

FILE *fp;

#define FRESH 1
#define CLOSED 0
#define OPEN 2

void Konec(void) {
 fclose(fp);exit(1);
}

void Init(char *fname) {
  if ((fp=fopen(fname,"rt")) == NULL) {printf("\nFile opening error.\n");exit(1);}
}

int NextToken(void) {
  char c;
  int i=0;
  c=fgetc(fp);
  if (c==EOF) {printf("\nBad input.\n");Konec();}
  while (c==' ' || c=='\t' || c=='\n') c=fgetc(fp);
  while (isdigit(c)) {i=i*10+(c-'0');c=fgetc(fp);}
  ungetc(c,fp);
  return(i);
}

 int fronta[40];
 int f=0,l=0;

void InitFronta (void) {
 f=0;l=0;
}

void UlozFronta(int a, int b) {
 fronta[f++]=a;fronta[f++]=b;
}

int PrazdnaFronta(void) {
 if (f==l) return 1; else return 0;
}

int FrontaFirst(void) {
 int v=fronta[l++];
 if (l>40) l=0;
 return v;
}

int main (int argc, char *argv[]) {
   int mx,my,x,y,x1,y1,x2,y2,i,sx,sy;
   int px[20][20],py[20][20],cesta[40];
   int pole[20][20][5];
	//0 - vyska, visited
	//1-4 - smer

   printf("\n\n");

   if (argc==1) Init("test.txt");
   else Init(argv[1]);

   mx=NextToken();
   my=NextToken();
   if (mx>20 || mx<1 || my>20 || my<0) {printf("Number of roads must be 1..20");Konec();}

   for (x=0; x<mx; x++)
    for (y=0; y<my; y++) {
     pole[x][y][0]=NextToken();
     pole[x][y][1]=0;pole[x][y][2]=0;pole[x][y][3]=0;pole[x][y][4]=0;
    }

   x=NextToken();y=NextToken();x1=NextToken();y1=NextToken();
   while (!(x==0 && y==0 && x1==0 && y1==0)) {
    for (;x<x1;x++) if ((pole[x][y-1][0]-pole[x-1][y-1][0])<=10) pole[x-1][y-1][1]=1;
    for (;x1<x;x--) if ((pole[x-2][y-1][0]-pole[x-1][y-1][0])<=10) pole[x-1][y-1][3]=1;
    for (;y<y1;y++) if ((pole[x-1][y][0]-pole[x-1][y-1][0])<=10) pole[x-1][y-1][2]=1;
    for (;y1<y;y--) if ((pole[x-1][y-2][0]-pole[x-1][y-1][0])<=10) pole[x-1][y-1][4]=1;
    x=NextToken();y=NextToken();x1=NextToken();y1=NextToken();
   }

   for (x=0; x<mx; x++) for (y=0; y<my; y++) pole[x][y][0]=0;

   x=NextToken()-1;y=NextToken()-1;x2=NextToken()-1;y2=NextToken()-1;
   while (!(x==-1 && y==-1 && x2==-1 && y2==-1)) {
    if (x==x2 && y==y2) printf("\nTo get from %d-%d to %d-%d, stay put!",x+1,y+1,x2+1,y2+1);
    else {
//hledat
     x1=x;y1=y;
     for (x=0;x<mx;x++) for (y=0;y<my;y++) {
      pole[x][y][0]=FRESH;px[x][y]=-1;py[x][y]=-1;
     }
     pole[x1][y1][0]=OPEN;
     InitFronta();UlozFronta(x1,y1);
     while (!PrazdnaFronta()) {

      x=FrontaFirst();y=FrontaFirst();
	if (pole[x][y][1]==1 && pole[x+1][y][0]==FRESH) {
	  pole[x+1][y][0]=OPEN;
	  px[x+1][y]=x;py[x+1][y]=y;
	  UlozFronta(x+1,y);
	  if (x2==x+1 && y2==y) {sx=x+1;sy=y;break;}
	}
	if (pole[x][y][3]==1 && pole[x-1][y][0]==FRESH) {
	  pole[x-1][y][0]=OPEN;
	  px[x-1][y]=x;py[x-1][y]=y;
	  UlozFronta(x-1,y);
	  if (x2==x-1 && y2==y) {sx=x-1;sy=y;break;}
	}
	if (pole[x][y][4]==1 && pole[x][y-1][0]==FRESH) {
	  pole[x][y-1][0]=OPEN;
	  px[x][y-1]=x;py[x][y-1]=y;
	  UlozFronta(x,y-1);
	  if (x2==x && y2==y-1) {sx=x;sy=y-1;break;}
	}
	if (pole[x][y][2]==1 && pole[x][y+1][0]==FRESH) {
	  pole[x][y+1][0]=OPEN;
	  px[x][y+1]=x;py[x][y+1]=y;
	  UlozFronta(x,y+1);
	  if (x2==x && y2==y+1) {sx=x;sy=y+1;break;}
	}
       pole[x][y][0]=CLOSED;

     }
     if (PrazdnaFronta()) printf("\nThere is no acceptable route from %d-%d to %d-%d",x1+1,y1+1,x2+1,y2+1);
     else {
      printf("\n");x=sx;y=sy;i=0;
      while (!(x==-1)) {
	cesta[i++]=x;cesta[i++]=y;
	sx=px[x][y];y=py[x][y];x=sx;
      }i--;
     while (i>0) {
      printf("%d-%d",cesta[i--]+1,cesta[i--]+1);
      if (i>0) printf(" to ");
     }
     }
    }
    x=NextToken()-1;y=NextToken()-1;x2=NextToken()-1;y2=NextToken()-1;
   }
   return(0);
}