#include<stdio.h>
#include<math.h>
#define MAX 256
#define M 1e-15
  int zadani;
  int r,c,r1,r2,c1,c2,h[MAX][MAX],vis[MAX][MAX],min[MAX][MAX];
  int fr[MAX*MAX],fc[MAX*MAX],f,fp;
int okayv(int X1, int Y1, int Z1, int X2, int Y2, int Z2) {
  int i,j1,j2,x,y,z;
  double t,X,Y,Z,XD,YD,ZD;
  if (X1>X2) { x=X1; X1=X2; X2=x; y=Y1; Y1=Y2; Y2=y; z=Z1; Z1=Z2; Z2=z; }
  if (X1<X2) {
    t=1/(double)(X2-X1); YD=(double)(Y2-Y1)*t; ZD=(double)(Z2-Z1)*t;
    for (i=X1+1, Y=(double)Y1+.5+YD/2, Z=(double)Z1+ZD/2; i<=X2; i++, Y+=YD, Z+=ZD) {
      if (Y2<Y1) {
        j1=floor(Y+M);
        j2=ceil(Y-M)-1;
        }
      else {
        j2=floor(Y+M);
        j1=ceil(Y-M)-1;
        }     
      if (h[i-1][j1]>=Z-M) return 0;
      if (h[i][j2]>=Z-M) return 0;
      /* printf("%lf %lf %lf %lf %lf\n",X,Y,Z,YD,ZD); */
      }
    }
  if (Y1>Y2) { x=X1; X1=X2; X2=x; y=Y1; Y1=Y2; Y2=y; z=Z1; Z1=Z2; Z2=z; }
  if (Y1<Y2) {
    t=1/(double)(Y2-Y1); XD=(double)(X2-X1)*t; ZD=(double)(Z2-Z1)*t;
    for (i=Y1+1, X=(double)X1+.5+XD/2, Z=(double)Z1+ZD/2; i<=X2; i++, X+=XD, Z+=ZD) {
      if (X2<X1) {
        j1=floor(X+M);
        j2=ceil(X-M)-1;
        }
      else {
        j2=floor(X+M);
        j1=ceil(X-M)-1;
        }     
      if (h[j1][i-1]>=Z-M) return 0;
      if (h[j2][i]>=Z-M) return 0;
      }
    }
  return 1;
  }
int checkv(int R, int C) {
  if (okayv(R,C,h[R][C]+1,r1,c1,h[r1][c1]+1)) return 1;
  if (okayv(R,C,h[R][C]+1,r2,c2,h[r2][c2]+1)) return 1;
  return 0;
  }
void step(int R, int C, int H, int D) {
  if (R<0||C<0||R>=r||C>=c) return;
  if (h[R][C]<H-3||h[R][C]>H+1) return;
  if (min[R][C]>=0) return;
  if (vis[R][C]==-1) vis[R][C]=checkv(R,C);
  if (vis[R][C]==0) return;
  /* printf("New: %d %d %d\n",R,C,D+1); */
  fr[f]=R; fc[f]=C; min[R][C]=D+1; f++;
  }
int main() {
  int i,j;
  scanf("%d",&zadani);
  while (zadani--) {
    scanf("%d %d",&r,&c);
    for (i=0; i<r; i++) for (j=0; j<c; j++) {
      scanf("%d",&h[i][j]); vis[i][j]=-1; min[i][j]=-1;
      }
    scanf("%d %d %d %d",&r1,&c1,&r2,&c2);
    if (r1==r2&&c1==c2) { printf("The shortest path is 0 steps long.\n"); continue; }
    r1--; c1--; r2--; c2--;
    min[r1][c1]=0; vis[r1][c1]=1; vis[r2][c2]=1;
    fr[0]=r1; fc[0]=c1; f=1;
    for (fp=0; fp<f&&min[r2][c2]==-1; fp++) {
      step(fr[fp]-1,fc[fp],h[fr[fp]][fc[fp]],min[fr[fp]][fc[fp]]);
      step(fr[fp]+1,fc[fp],h[fr[fp]][fc[fp]],min[fr[fp]][fc[fp]]);
      step(fr[fp],fc[fp]-1,h[fr[fp]][fc[fp]],min[fr[fp]][fc[fp]]);
      step(fr[fp],fc[fp]+1,h[fr[fp]][fc[fp]],min[fr[fp]][fc[fp]]);
      }
    if (min[r2][c2]==-1) printf("Mission impossible!\n"); else printf("The shortest path is %d steps long.\n",min[r2][c2]); 
    }
  return 0;
  }