#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int vx[4]={-1,0,1,0},vy[4]={0,1,0,-1};

int v[310][310],val[90010],sol[20010],rad[90010];
pair<int,int> v1[90010],q1[20010],q2[20010],q[20010];
vector<int> g[90010];

int radacina(int x)
{
    if(x==rad[x]) return x;
    rad[x]=radacina(rad[x]);
    return rad[x];
}

void reuneste(int x,int y)
{
    int a=radacina(x),b=radacina(y);
    rad[a]=b;
}

int main()
{
    freopen("matrice2.in","r",stdin);
    freopen("matrice2.out","w",stdout);
    int n,l1=0,l=0,x,mx=0,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            scanf("%d",&x);
            v[i][j]=++l1;
            val[v[i][j]]=x;
            v1[++l]={x,v[i][j]};
            mx=max(mx,x);
        }
    for(int i=1;i<=m;i++) scanf("%d%d%d%d",&q1[i].first,&q1[i].second,&q2[i].first,&q2[i].second);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            for(int k=0;k<4;k++)
            {
                int x=i+vx[k],y=j+vy[k];
                if(x<1 or x>n or y<1 or y>n) continue;
                g[v[i][j]].push_back(v[x][y]);
            }
    sort(v1+1,v1+l+1);
    int logg=0;
    while((1<<logg)<=mx) logg++;
    logg--;
    for(int step=logg;step>=0;step--)
    {
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++) rad[v[i][j]]=v[i][j];
        l1=0;
        for(int i=1;i<=m;i++)
            if(sol[i]+(1<<step)<mx) q[++l1]={sol[i]+(1<<step),i};
        sort(q+1,q+l1+1);
        int poz=l1;
        for(int i=l;i>=1;i--)
        {
            int nod=v1[i].second,c=v1[i].first;
            for(int i=0;i<g[nod].size();i++)
            {
                int vec=g[nod][i];
                if(val[vec]<c) continue;
                if(radacina(nod)!=radacina(vec)) reuneste(nod,vec);
            }
            if(c>v1[i-1].first)
            {
                while(poz>0 && q[poz].first>v1[i-1].first)
                {
                    int poz1=q[poz].second;
                    if(radacina(v[q1[poz1].first][q1[poz1].second])==radacina(v[q2[poz1].first][q2[poz1].second])) sol[poz1]+=(1<<step);
                    poz--;
                }
            }
        }
    }
    for(int i=1;i<=m;i++) printf("%d\n",sol[i]);
    return 0;
}