#include<stdio.h>
#include<set>
using namespace std;
#define nmax 305
#define inf 1000005
struct element{long l, c;};
long i, n, q, ii, j, l1, c1, l2, c2, d, st, dr, mjc, maxi, w, inc, sf, lac, cac;
long a[nmax][nmax], nr[nmax][nmax], fol[nmax][nmax];
element el, co[nmax*nmax];
long vl[5]={0,-1,0,0,1};
long vc[5]={0,0,-1,1,0};
bool ok;

void citire()
{
    scanf("%ld %ld",&n,&q);
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
        {
            scanf("%ld",&a[i][j]);
            if (a[i][j]>maxi)
                maxi=a[i][j];
        }

    //bordare
    for (i=0;i<=n+1;i++)
        a[i][0]=a[i][n+1]=a[0][i]=a[n+1][i]=-inf;
}

void verificare()
{
    co[1].l=l1; co[1].c=c1; fol[l1][c1]=w;
    inc=sf=1;
    while (inc<=sf)
    {
        el=co[inc]; inc++;
        for (d=1;d<=4;d++)
        {
            lac=el.l+vl[d]; cac=el.c+vc[d];
            if (fol[lac][cac]<w)
                if (a[lac][cac]>=mjc)
                {
                    fol[lac][cac]=w;
                    co[++sf].l=lac; co[sf].c=cac;
                    if ((lac==l2)&&(cac==c2))
                        inc=sf+5;
                }
        }
    }
    ok=(fol[l2][c2]==w);
}

void rezolvare()
{
    st=1;  dr=a[l1][c1];
    while (st<=dr)
    {
        mjc=(st+dr)/2;
        w++;
        verificare();
        if (ok)
            st=mjc+1;
        else
            dr=mjc-1;
    }
    printf("%ld\n",dr);
}

int main()
{
    freopen("matrice2.in","r",stdin);
    freopen("matrice2.out","w",stdout);
    citire();
    for (ii=1;ii<=q;ii++)
    {
        scanf("%ld %ld %ld %ld",&l1,&c1,&l2,&c2);
        rezolvare();
    }
    return 0;
}