#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream in ("matrice2.in");
ofstream out("matrice2.out");
int n, nrq, x1, x2, y1, y2;
int dsu[90005], vals[90005], dx[]={0, 1, 0, -1}, dy[]={1, 0, -1, 0};
struct tl
{
    int p1, p2, sol;
};
vector <tl> queries;
vector <int> a, poz;
inline void reset()
{
    for(int i=0; i<n*n; i++)
        dsu[i]=i;
}
int findDad(int val)
{
    if(dsu[val]!=val) return dsu[val]=findDad(dsu[val]);
    return dsu[val];
}
inline void unite(int poz)
{
    int x=poz/n+1;
    int y=poz%n+1;
    for(int i=0; i<4; i++)
    {
        int xx=x+dx[i];
        int yy=y+dy[i];
        if(xx>0&&xx<=n&&yy>0&&yy<=n&&vals[(xx-1)*n+yy-1]>=vals[poz])
            if(findDad(poz)!=findDad((xx-1)*n+yy-1))
                dsu[dsu[(xx-1)*n+yy-1]]=dsu[poz];
    }
}
int main()
{
    in>>n>>nrq;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            in>>vals[(i-1)*n+j-1], a.push_back((i-1)*n+j-1);
    a.shrink_to_fit();
    sort(a.begin(), a.end(), [&](const int i, const int j)
        {
            return vals[i]>vals[j];
        }
    );
    queries.resize(nrq);
    poz.resize(nrq);
    for(int i=0; i<nrq; i++)
    {
        in>>x1>>y1>>x2>>y2; poz[i]=i;
        queries[i].p1=(x1-1)*n+y1-1;
        queries[i].p2=(x2-1)*n+y2-1;
    }
    for(int put=20; put>=0; put--)
    {
        reset();
        sort(poz.begin(), poz.end(), [&](const int i, const int j)
            {
                return queries[i].sol>queries[j].sol;
            }
        );
        for(int k=0, i=0; i<nrq; i++)
        {
            while(k<n*n&&vals[a[k]]>=(1<<put)+queries[poz[i]].sol)
                unite(a[k++]);
            if(findDad(queries[poz[i]].p1)==findDad(queries[poz[i]].p2))
                queries[poz[i]].sol+=(1<<put);
        }
    }
    for(int i=0; i<nrq; i++)
        out<<queries[i].sol<<"\n";
    return 0;
}