#include <bits/stdc++.h>

using namespace std;

struct query{
    int x1, y1, x2, y2, mx = 0;
};

int n, test, v[305][305], c[400*400], rng[400*400], dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
set<int> s;
map<int, vector< pair<int, int> > > m;
vector<query> q;

int find(int x)
{
    int R;
    for (R = x; c[R] != R; R = c[R]);
    while(c[x] != x){
        int y = c[x];
        c[x] = R;
        x = y;
    }
    return R;
}

void unite(int x, int y)
{
    if(rng[x] > rng[y])
        c[y] = x;
    else c[x] = y;
    if(rng[x] == rng[y])
        ++rng[y];
}

int main()
{
    ifstream fin ("matrice2.in");
    ofstream fout ("matrice2.out");
    for (int i = 1; i < 400*400; ++i){
        c[i] = i;
        rng[i] = 1;
    }
    fin >> n >> test;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j){
            fin >> v[i][j];
            m[v[i][j]].push_back(make_pair(i, j));
            s.insert(-v[i][j]);
        }
    for (int i = 1; i <= test; ++i){
        query aux;
        fin >> aux.x1 >> aux.y1 >> aux.x2 >> aux.y2;
        q.push_back(aux);
    }
    for (set<int>::iterator It = s.begin(); It != s.end(); ++It){
        int x = -*It;
        for (vector< pair<int, int> >::iterator it = m[x].begin(); it != m[x].end(); ++it)
            for (int i = 0; i < 4; ++i)
                if(v[it->first+dx[i]][it->second+dy[i]] >= v[it->first][it->second])
                    unite(find((it->first+dx[i])*305+it->second+dy[i]), find(it->first*305+it->second));
        for (vector<query>::iterator it = q.begin(); it != q.end(); ++it)
            if(find(it->x1*305+it->y1) == find(it->x2*305+it->y2))
                it->mx = max(it->mx, x);
    }
    for (vector<query>::iterator it = q.begin(); it != q.end(); ++it)
        fout << it->mx << "\n";
    fin.close();
    fout.close();
    return 0;
}