#include<iostream>

#include<cstdio>

#include<cstring>

#include<queue>

using namespace std;

int a[][],x1,x2,y1,y2,k,n,m,vis[][];

int zz[][]={{,},{,-},{,},{-,}};

struct Node{

    int x,y,num,fx;

};

bool bfs()

{

    memset(vis,,sizeof(vis));

    queue <Node> q;

    Node tp,tmp;

    tp.x=x1;tp.y=y1;

    tp.fx=;tp.num=;

    q.push(tp);

    vis[x1][y1]=;

    while(!q.empty())

    {

        tp=q.front();

        q.pop();

        //cout<<tp.x<<" "<<tp.y<<endl;

        if(tp.x==x2&&tp.y==y2&&tp.num<=) return true;

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

        {

            tmp.x=tp.x+zz[i][];

            tmp.y=tp.y+zz[i][];

            if(tp.fx==)

            {

                tmp.fx=i+;tmp.num=tp.num;

            }

            else

            {

                if(tp.fx==i+) tmp.fx=i+,tmp.num=tp.num;

                else tmp.fx=i+,tmp.num=tp.num+;

            }

            if(tmp.num>) continue;

            if(tmp.x<=||tmp.x>n||tmp.y<=||tmp.y>m) continue;

            if(vis[tmp.x][tmp.y]==) continue;

            if(a[tmp.x][tmp.y]==||tmp.x==x2&&tmp.y==y2)

            {

                vis[tmp.x][tmp.y]=;

                q.push(tmp);

            }

        }

    }

    return false;

}

int main(void)

{

    int i,j;

    while(cin>>n>>m&&(n+m))

    {

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

           for(j=;j<=m;j++) cin>>a[i][j];

        cin>>k;

        while(k--)

        {

            cin>>x1>>y1>>x2>>y2;

            if(a[x1][y1]!=a[x2][y2]||(a[x1][y1]==a[x2][y2]&&a[x1][y1]==)||(a[x1][y1]==a[x2][y2]&&x1==y1&&x2==y2))

            {

                cout<<"NO"<<endl;

                continue;

            }

            if(bfs()==true) cout<<"YES"<<endl;

            else cout<<"NO"<<endl;

        }

    }

    return ;

}