#include <iostream>

#include <cstdlib>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

typedef double LF;

inline int gmin(int a, int b) {return a < b ? a : b;}

const int MaxN = 500 + 5, MaxM = 60000 + 5;

int n, m, Top, Blk, S, T;

int Sum[MaxN][MaxN], Has[MaxN][MaxN];

struct ENum

{

	int Num, x, y;

} E[MaxN * MaxN];

inline bool Cmp(ENum e1, ENum e2)

{

	return e1.Num < e2.Num;

}

struct EQ

{

	int x, y, xx, yy, k, Ans, Prev, Next;

	bool Inside(ENum e)

	{

		return (e.x >= x && e.x <= xx) && (e.y >= y && e.y <= yy);

	}

} Q[MaxM];

inline int GetSum(int x, int y, int xx, int yy)

{

	return Sum[xx][yy] - Sum[x - 1][yy] - Sum[xx][y - 1] + Sum[x - 1][y - 1];

}

int main()

{

	scanf("%d%d", &n, &m);

	Blk = (int)((LF)n * (1.0 + ((LF)n / sqrt((LF)m)))) + 1;

	Top = 0;

	for (int i = 1; i <= n; ++i)

		for (int j = 1; j <= n; ++j)

		{

			scanf("%d", &E[++Top].Num);

			E[Top].x = i; E[Top].y = j;

		}

	sort(E + 1, E + Top + 1, Cmp);

	for (int i = 1; i <= m; ++i)

		scanf("%d%d%d%d%d", &Q[i].x, &Q[i].y, &Q[i].xx, &Q[i].yy, &Q[i].k);

	for (int i = 1; i < m; ++i) Q[i].Next = i + 1;

	for (int i = 2; i <= m; ++i) Q[i].Prev = i - 1;

	S = m + 1; T = m + 2;

	Q[S].Next = 1; Q[1].Prev = S;

	Q[m].Next = T; Q[T].Prev = m;

	int p;

	for (int i = 1; i <= Top; i += Blk)

	{

		p = gmin(i + Blk - 1, Top);

		for (int j = i; j <= p; ++j)

			Has[E[j].x][E[j].y] = 1;

		for (int j = 1; j <= n; ++j)

			for (int k = 1; k <= n; ++k)

				Sum[j][k] = Sum[j - 1][k] + Sum[j][k - 1] - Sum[j - 1][k - 1] + Has[j][k];

		int j = Q[S].Next;

		while (j != T)

		{

			int CntNow = GetSum(Q[j].x, Q[j].y, Q[j].xx, Q[j].yy);

			if (CntNow >= Q[j].k)

			{

				int Pos = p;

				while (CntNow >= Q[j].k)

				{

					if (Q[j].Inside(E[Pos])) --CntNow;

					--Pos;

				}

				Q[j].Ans = E[Pos + 1].Num;

				Q[Q[j].Next].Prev = Q[j].Prev;

				Q[Q[j].Prev].Next = Q[j].Next;

			}

			j = Q[j].Next;

		}

	}

	for (int i = 1; i <= m; ++i) printf("%d\n", Q[i].Ans);

	return 0;

}