#include <bits/stdc++.h>

using namespace std;

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

int n, m, a[303][303];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
bitset<303> viz[303];

struct elem
{
    int val, x, y;
    bool operator < (const elem A) const
    {
        return val < A.val;
    }
};

void Bordare ()
{
    for (int i = 0; i <= n + 1; i++)
    {
        a[i][0] = a[i][n + 1] = 2e9;
        a[0][i] = a[n + 1][i] = 2e9;
    }
}

int Vecin (int x1, int y1, int x2,  int y2)
{
    if (abs (x1 -  x2) + abs(y1 - y2) == 1)
        return 1;
    return 0;
}

void Rezolva(int x1, int y1, int x2, int y2)
{
    int i, j, x, y, minim = a[x1][y1];
    priority_queue< elem > q;
    q.push({a[x1][y1], x1, y1});
    viz[x1][y1] = 1;
    for (i = 1; i <= n; i++)
        viz[i].reset();
    while (q.top().x != x2 || q.top().y != y2)
    {
        x = q.top().x;
        y = q.top().y;
        minim = min(minim, a[x][y]);
        if (Vecin(x, y, x2, y2))
        {
            minim = min(minim, a[x2][y2]);
            break;
        }
        q.pop();
        for (int k = 0; k < 4; k++)
        {
            i = x + dx[k];
            j = y + dy[k];
            if (!viz[i][j] && a[i][j] != 2e9)
            {
                q.push({a[i][j], i, j});
                viz[i][j] = 1;
            }
        }
    }
    fout << minim << "\n";
}

int main()
{
    int i, j, x1, x2, y1, y2;
    fin >> n >> m;
    for (i = 1; i <= n; i++)
        for(j = 1; j <= n; j++)
            fin >> a[i][j];
    Bordare();
    for (i = 1; i <= m; i++)
    {
        fin >> x1 >> y1 >> x2 >> y2;
        Rezolva(x1, y1, x2, y2);
    }
    return 0;
}