#include <bits/stdc++.h>

using namespace std;

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

int n, q, m[301][301];

bool viz[301][301];

bool ok(int x, int y)
{
    if(x > n || x < 1 || y > n || y < 1 || viz[x][y] == true) return false;
    return true;
}

bool BFS(int x1, int y1, int x2, int y2, int minimum)
{
    int dx[] = {1, -1, 0, 0};
    int dy[] = {0, 0, 1, -1};

    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            viz[i][j] = false;

    queue<pair<int, int>> ursu;

    ursu.push(make_pair(x1, y1));

    while(!ursu.empty())
    {
        int x = ursu.front().first;
        int y = ursu.front().second;

        ursu.pop();

        for(int i = 0; i < 4; ++i)
        {
            int nx = x + dx[i];
            int ny = y + dy[i];

            if(ok(nx, ny) == false) continue;
            if(m[nx][ny] < minimum) continue;

            viz[nx][ny] = true;

            ursu.push({nx, ny});
        }
    }

    return viz[x2][y2];
}

int maxCost(int x1, int y1, int x2, int y2)
{

    int left = 1, right = min(m[x1][y1], m[x2][y2]);

    while(left <= right)
    {
        int mid = (left + right) / 2;

        if(BFS(x1, y1, x2, y2, mid) == true) left = mid + 1;
        else right = mid - 1;
    }

    return right;
}

int main()
{
    fin >> n >> q;

    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            fin >> m[i][j];

    for(int i = 1; i <= q; ++i)
    {
        int x1, y1, x2, y2;
        fin >> x1 >> y1 >> x2 >> y2;

        fout << maxCost(x1, y1, x2, y2) << '\n';
    }
}