#include<cstdio>

 #include<string.h>

 #define inf 0x3f3f3f3f

 const int maxn=;

 using namespace std;

 const int dir[][]={{,},{,},{,-},{-,}};

 int flag[maxn+][maxn+];

 int n,m,q;

 int sx,sy,gx,gy;

 int a[maxn+][maxn+];

 int dfs(int x,int y,int dirc,int turn){

   //printf("%d %d %d %d\n",x,y,dirc,turn);

    if(turn>) return ;

    if(x==gx&&y==gy){

         return ;

    }

    for(int i=;i<;i++){

         if(turn==&&i!=dirc) continue;

         int nx=x+dir[i][];

         int ny=y+dir[i][];

         if(nx==gx&&ny==gy){

                 if(i==dirc||dirc==-) return ;

                 else if(i!=dirc&&turn+<=) return ;

                 continue;

         }

         if(nx>=&&nx<=n&&ny>=&&ny<=m&&!flag[nx][ny]&&!a[nx][ny]){

                 if(i==dirc||dirc==-){

                         flag[nx][ny]=;

                         if(dfs(nx,ny,i,turn)) return ;

                 } else if(i!=dirc){

                    flag[nx][ny]=;

                    if(dfs(nx,ny,i,turn+)) return ;

                 }

                 flag[nx][ny]=;

         }

    }

    return ;

 }

 int main()

 {

     while(scanf("%d%d",&n,&m)!=EOF){

         if(n==&&m==)  break;

         for(int i=;i<=n;i++){

                 for(int j=;j<=m;j++){

                         scanf("%d",&a[i][j]);

                 }

         }

         scanf("%d",&q);

         while(q--){

            memset(flag,,sizeof(flag));

            scanf("%d%d%d%d",&sx,&sy,&gx,&gy);

            if(!a[sx][sy]||!a[gx][gy]||a[sx][sy]!=a[gx][gy]){

                 printf("NO\n");

                 continue;

            }

            if(dfs(sx,sy,-,)) printf("YES\n");

            else printf("NO\n");

         }

     }

     return ;

 }