#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define ll long long
#define ull unsigned long long
#define x first
#define y second
#define pi pair<int,int>
#define pl pair<ll,ll>

using namespace std;
ifstream fin("matrice2.in");
ofstream fout("matrice2.out");


const ll N=9e4+5,INF=1e18,MOD=100003,M=1e2+5,inf=INT_MAX;

int n,q;
int v[305][305];
int par[N],siz[N],ans[20005];
set<int> s[N];
set<int> :: iterator it,it2;


struct str
{
    int cost,a,b;
};
vector<str> edges;

int nr(int i,int j)
{
    return (i-1)*n+j;
}

bool cmp(str a,str b)
{
    return a.cost>b.cost;
}

int parent(int node)
{
    if(par[node]==node)return node;
    return par[node]=parent(par[node]);
}

void dsu(int a,int b,int cost)
{
    a=parent(a);
    b=parent(b);
    if(siz[a]<siz[b])swap(a,b);
    siz[a]+=siz[b];
    par[b]=a;

    for(it=s[b].begin();it!=s[b].end();it++)
    {
        it2=s[a].find(*it);
        if(it2==s[a].end())
        {
            s[a].insert(*it);
        }
        else
        {
            ans[*it]=cost;
            s[a].erase(*it);
        }
    }
}

int main()
{
    fin>>n>>q;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fin>>v[i][j];
            par[nr(i,j)]=nr(i,j);
            siz[nr(i,j)]=1;
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(i>1)
            {
                edges.pb({min(v[i][j],v[i-1][j]),nr(i,j),nr(i-1,j)});
            }
            if(j>1)
            {
                edges.pb({min(v[i][j],v[i][j-1]),nr(i,j),nr(i,j-1)});
            }
        }
    }
    sort(edges.begin(),edges.end(),cmp);

    for(int i=1;i<=q;i++)
    {
        int x1,x2,y1,y2;
        fin>>x1>>y1>>x2>>y2;
        s[nr(x1,y1)].insert(i);
        s[nr(x2,y2)].insert(i);
    }
    for(int i=0;i<edges.size();i++)
    {
        if(parent(edges[i].a)==parent(edges[i].b))continue;

        dsu(edges[i].a,edges[i].b,edges[i].cost);
    }

    for(int i=1;i<=q;i++)
    {
        fout<<ans[i]<<'\n';
    }

}