#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
//#include <bits/stdc++.h>
#define in fin
#define out fout

using namespace std;

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

const int ox[] = {0, 0, 1, -1};
const int oy[] = {1, -1, 0, 0};

struct cell{
    int x, y, vl;
};

struct query{
    int x1, y1, x2, y2, c1, c2, idx;
};

bool operator<(cell a, cell b){
    return a.vl > b.vl;
}

bool operator<(query a, query b){
    if(min(a.c1, a.c2) != min(b.c1, b.c2)) return min(a.c1, a.c2) > min(b.c1, b.c2);
    else return max(a.c1, a.c2) > max(b.c1, b.c2);
}

int f[90001];
int s[90001];

int find_father(int x){
    if(x == f[x]) return x;
    f[x] = find_father(f[x]);
    return f[x];
}

bool in_acelasi_zet(int a, int b){
    return (find_father(a) == find_father(b));
}

void add(int a, int b){
    int f1 = find_father(a);
    int f2 = find_father(b);

    if(f1 == f2) return;

    if(s[f1] > s[f2]){
        s[f1] += s[f2];
        f[f2] = f1; 
    }else{
        s[f2] += s[f1];
        f[f1] = f2;
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    for(int i = 0; i <= 90000; i++){
        f[i] = i;
        s[i] = 1;
    }

    int n, q; in >> n >> q;
    int v[n][n];
    cell l[n * n + 1];

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            in >> v[i][j];
            l[ i * n + j ].vl = v[i][j];
            l[i * n + j].x = i;
            l[i * n + j].y = j;
        }
    }

    sort(l + 1, l + n * n + 1);

    set<query> qr;
    for(int i = 0; i < q; i++){
        query x;
        in >> x.x1 >> x.y1 >> x.x2 >> x.y2;
        x.x1--; x.y1--;
        x.x2--; x.y2--;
        x.c1 = v[ x.x1 ][ x.y1 ];
        x.c2 = v[ x.x2 ][ x.y2 ];
        x.idx = i;

        qr.insert(x);
    }

    int sol[q];
    for(int i = 0; i < q; i++) sol[i] = 0;
    int it = 0; // pt queries
    for(int i = 0; i < n * n; i++){
        // cout << "Adaugam " << l[i].vl << " ( " << l[i].x << " , " << l[i].y << " )\n";
        int x = l[i].x, y = l[i].y;

        for(int j = 0; j < 4; j++){
            if(x + ox[j] < 0 || x + ox[j] >= n) continue; 
            if(y + oy[j] < 0 || y + oy[j] >= n) continue; 

            if(v[ x + ox[j] ][ y + oy[j] ] >= v[x][y]){
                add( x * n + y, (x + ox[j]) * n + (y + oy[j]) );
            }
        }

        auto ii = qr.begin();
        while(ii != qr.end()){
            if((*ii).c1 < v[x][y] || (*ii).c2 < v[x][y]) break;
            if(sol[(*ii).idx] == 0 && in_acelasi_zet((*ii).x1 * n + (*ii).y1, (*ii).x2 * n + (*ii).y2)){
                sol[ (*ii).idx ] = v[x][y];
                qr.erase(ii);
            }else ii++;
        }
    }

    for(int i = 0; i < q; i++) out << sol[i] << '\n';

    return 0;
}