#include <bits/stdc++.h>
#define maxN 305
#define maxQ 20004
using namespace std;
int dx[]={1,-1,0,0};
int dy[]={0,0,-1,1};
struct query
{
    int x1,x2,y1,y2,ind;
}qry[maxQ];
pair<int,int> v[maxN*maxN];
int n,i,j,m,q,a1,a2,b1,b2,act,sz;
int a[maxN][maxN],b[maxN][maxN],tata[maxN*maxN],sol[maxQ];
bool cmp(pair<int,int>p,pair<int,int>q)
{
    return a[p.first][p.second]>a[q.first][q.second];
}
bool comp(query p,query q)
{
    return sol[p.ind]>sol[q.ind];
}
int Find(int x)
{
    if(tata[x]==x)
        return tata[x];
    return tata[x]=Find(tata[x]);
}
void Union(int x,int y)
{
    int tx=Find(x);
    int ty=Find(y);
    tata[ty]=tx;
}
int main()
{
    freopen("matrice2.in","r",stdin);
    freopen("matrice2.out","w",stdout);
    scanf("%d %d",&n,&q);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            scanf("%d",&a[i][j]),
            v[++sz]=make_pair(i,j);
    sort(v+1,v+sz+1,cmp);
    for(i=1;i<=q;i++)
        qry[i].ind=i,
        scanf("%d %d %d %d",&qry[i].x1,&qry[i].y1,&qry[i].x2,&qry[i].y2);
    for(int step=(1<<20);step;step>>=1)
    {
        sort(qry+1,qry+q+1,comp);
        memset(b,0,sizeof(b));
        for(i=1;i<=sz;i++)
            tata[i]=i;
        for(i=1,j=1,act=0;j<=q;j++)
        {
            while(i<=sz && sol[qry[j].ind]+step<=a[v[i].first][v[i].second])
            {
                int x=v[i].first;
                int y=v[i].second;
                b[x][y]=++act;
                for(int k=0;k<4;k++)
                {
                    int newx=x+dx[k];
                    int newy=y+dy[k];
                    if(b[newx][newy])
                        Union(b[x][y],b[newx][newy]);
                }
                i++;
            }
            int root=Find(b[qry[j].x1][qry[j].y1]);
            if(root && root==Find(b[qry[j].x2][qry[j].y2]))
                sol[qry[j].ind]+=step;
        }
    }
    for(i=1;i<=q;i++)
        printf("%d\n",sol[i]);
    return 0;
}