#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin("matrice2.in");
ofstream cout("matrice2.out");

const int NMAX = 300;
const int QMAX = 20000;

int N, Q;
int mat[NMAX + 2][NMAX + 2];

bool active[NMAX + 2][NMAX + 2];
pair <short int, short int> dad[NMAX + 2][NMAX + 2];

vector < pair <int, pair<short int, short int>> > fields;

vector <int> qr[NMAX + 2][NMAX + 2];
int ans[QMAX + 2];

int main()
{
    cin >> N >> Q;

    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= N; j++)
        {
            cin >> mat[i][j];
            active[i][j] = false;
            dad[i][j] = {i, j};
            fields.push_back({mat[i][j], {i, j}});
        }

    for(int i = 1; i <= Q; i++)
    {
        int x, y, z, t;
        cin >> x >> y >> z >> t;
        qr[x][y].push_back(i);
        qr[z][t].push_back(i);
    }

    sort(fields.begin(), fields.end());

    return 0;
}