#include <bits/stdc++.h>

using namespace std;
ifstream fin("matrice2.in");
ofstream fout("matrice2.out");
struct point
{
    int x,y;
};
int n,q,v[305][305],sol[20005];
set<int> queries[305*305];
int mine[305*305];
vector<point> dsu[305*305];
int comp[305][305];
int diri[5]={-1,1,0,0};
int dirj[5]={0,0,-1,1};
int curval;
bool used[305][305];
bool byval(point a,point b)
{
   return v[a.x][a.y]>v[b.x][b.y];
}
void dsu_merge(int c1,int c2)
{
    if(dsu[c1].size()<dsu[c2].size())
        swap(c1,c2);
    for(auto i:dsu[c2])
    {
        dsu[c1].push_back(i);
        comp[i.x][i.y]=c1;
    }

    int c3=mine[c1];
    int c4=mine[c2];

    if(queries[c3].size()<queries[c4].size())
        swap(c3,c4);
    for(int i:queries[c4])
    {
        if(queries[c3].find(i)!=queries[c3].end())
        {
            sol[i]=curval;
            queries[c3].erase(i);
        }
        else
            queries[c3].insert(i);
    }
    mine[c1]=c3;
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>q;
    vector<point> ord;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            fin>>v[i][j];
            ord.push_back({i,j});
            comp[i][j]=(i-1)*n+j;
            dsu[comp[i][j]].push_back({i,j});
            mine[comp[i][j]]=comp[i][j];
        }
    for(int i=1;i<=q;i++)
    {
        int x1,y1,x2,y2;
        fin>>x1>>y1>>x2>>y2;
        queries[comp[x1][y1]].insert(i);
        queries[comp[x2][y2]].insert(i);
    }
    sort(ord.begin(),ord.end(),byval);
    for(auto z:ord)
    {
        int x=z.x;
        int y=z.y;
        curval=v[x][y];
        used[x][y]=1;
        for(int d=0;d<4;d++)
        {
            int l=x+diri[d];
            int c=y+dirj[d];
            if(l>=1&&l<=n&&c>=1&&c<=n&&used[l][c])
            {
                int c1=comp[x][y];
                int c2=comp[l][c];
                if(c1!=c2)
                    dsu_merge(c1,c2);
            }
        }
    }
    for(int i=1;i<=q;i++)
        fout<<sol[i]<<'\n';
    return 0;
}