#include<stdio.h>
#include<set>
using namespace std;
#define nmax 305
#define inf 1000005
long i, n, q, ii, j, l1, c1, l2, c2, d, linac, colac, cac;
long a[nmax][nmax], nr[nmax][nmax];
set <pair <long, pair<long, long> > > h;
pair <long, pair<long, long> > pr;
pair<long, long> el;
long vl[5]={0,-1,0,0,1};
long vc[5]={0,0,-1,1,0};

void citire()
{
    scanf("%ld %ld",&n,&q);
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            scanf("%ld",&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 rezolvare()
{
    for (i=0;i<=n+1;i++)
        for (j=0;j<=n+1;j++)
            nr[i][j]=-inf;
    nr[l1][c1]=a[l1][c1];   el.first=l1;    el.second=c1;
    h.insert(make_pair(-a[l1][c1],el));
    while (h.size())
    {
        pr=*h.begin();   h.erase(h.begin());
        for (d=1;d<=4;d++)
        {
            linac=pr.second.first+vl[d]; colac=pr.second.second+vc[d];
            el.first=linac; el.second=colac;
            cac=-pr.first;
            if (cac>a[linac][colac])
                cac=a[linac][colac];
            if (-cac<-nr[linac][colac])
            {
                h.erase(make_pair(-nr[linac][colac],el));
                nr[linac][colac]=cac;
                h.insert(make_pair(-nr[linac][colac],el));
            }
        }
    }
}

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();
        printf("%ld\n",nr[l2][c2]);
    }
    return 0;
}