#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
const int nmax=90005;
vector<int> vv[nmax];
int lev[nmax],first[nmax],rmq[2][2*nmax],orig[nmax],tt[nmax],lg[2*nmax],ans[20005];
int n,k,q,i,j,cnt,curr,use,ind,x,y,aux,rad,li,ci,lf,cf,dif;
struct node
{
    int val,poz;
}v[nmax];
bool comp(node unu,node doi)
{
    return unu.val>doi.val;
}
inline int mnlev(int a,int b)
{
    if(lev[a]<lev[b]) return a;
    return b;
}
void dfs(int x)
{
    k++;rmq[0][k]=x;first[x]=k;
    for(int i=0;i<vv[x].size();i++)
    {
        lev[vv[x][i]]=lev[x]+1;
        dfs(vv[x][i]);
        k++;rmq[0][k]=x;
    }
}
void next_rmq()
{
    curr++;use=curr%2;
    for(i=1;i<=k-(1<<use)+1;i++)
    {
        rmq[use][i]=mnlev(rmq[1-use][i],rmq[1-use][i+(1<<(curr-1))]);
    }
}
struct query
{
    int a,b,idx;
}el;
vector<query> vq[20];
int finds(int x)
{
    y=x;
    while(x!=tt[x])
        x=tt[x];
    while(y!=x)
    {
        aux=tt[y];
        tt[y]=x;
        y=aux;
    }
    return x;
}
int main()
{
    ifstream f("matrice2.in");
    ofstream g("matrice2.out");
    f>>n>>q;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
    {
        f>>v[(i-1)*n+j].val;
        orig[(i-1)*n+j]=v[(i-1)*n+j].val;
        v[(i-1)*n+j].poz=(i-1)*n+j;
    }
    sort(v+1,v+n*n+1,comp);
    for(i=1;i<=n*n;i++)
    {
        ind=v[i].poz;
        tt[ind]=ind;
        if(ind-n>0&&tt[ind-n]!=0&&finds(ind)!=finds(ind-n)) {vv[ind].push_back(finds(ind-n));tt[finds(ind-n)]=ind;}
        if(ind+n<=n*n&&tt[ind+n]!=0&&finds(ind)!=finds(ind+n)) {vv[ind].push_back(finds(ind+n));tt[finds(ind+n)]=ind;}
        if(ind-1>0&&tt[ind-1]!=0&&ind%n!=1&&finds(ind)!=finds(ind-1)) {vv[ind].push_back(finds(ind-1));tt[finds(ind-1)]=ind;}
        if(ind+1<=n*n&&tt[ind+1]!=0&&ind%n!=0&&finds(ind)!=finds(ind+1)) {vv[ind].push_back(finds(ind+1));tt[finds(ind+1)]=ind;}
    }
    rad=1;
    while(rad!=tt[rad])
        rad=tt[rad];
    dfs(rad);
    for(i=2;i<=k;i++)
    {
        lg[i]=lg[i/2]+1;
    }
    for(i=1;i<=q;i++)
    {
        f>>li>>ci>>lf>>cf;
        el.a=first[(li-1)*n+ci];
        el.b=first[(lf-1)*n+cf];
        if(el.a>el.b) swap(el.a,el.b);
        el.idx=i;
        vq[lg[el.b-el.a+1]].push_back(el);
    }
    for(cnt=0;cnt<=lg[k];cnt++)
    {
        for(j=0;j<vq[cnt].size();j++)
        {
            el=vq[cnt][j];
            dif=el.b-el.a+1-(1<<cnt);
            ans[el.idx]=orig[mnlev(rmq[use][el.a],rmq[use][el.a+dif])];
        }
        next_rmq();
    }
    for(i=1;i<=q;i++)
        g<<ans[i]<<'\n';
    return 0;
}