#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#define N 510

#define M 60010

using namespace std;

int tree[N<<1][N<<1],ans[M],n,m;

struct pnt {int x,y,val;}a[N*N]; inline bool cmp(const pnt &a,const pnt &b) {return a.val<b.val;}

struct Node {int x1,x2,y1,y2,k,id;}q[M],t[M];

inline char nc() {static char *p1,*p2,buf[100000]; return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;}

int rd() {int x=0; char c=nc(); while(!isdigit(c)) c=nc(); while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=nc(); return x;}

inline int lowbit(int x) {return x&(-x);}

void update(int x,int y,int val)

{

	for(int i=x;i<=n+1;i+=lowbit(i)) for(int j=y;j<=n+1;j+=lowbit(j)) tree[i][j]+=val;

}

int query(int x,int y)

{

	int ans=0; for(int i=x;i>=1;i-=lowbit(i)) for(int j=y;j>=1;j-=lowbit(j)) ans+=tree[i][j];

	return ans;

}

void solve(int x,int y,int l,int r)

{

	int tl=x,tr=y;

	if(x>y) return;

	if(l==r)

	{

		for(int i=x;i<=y;i++) ans[q[i].id]=a[l].val;

		return;

	}

	int mid=(l+r)>>1;

	for(int i=l;i<=mid;i++) update(a[i].x,a[i].y,1);

	for(int i=x;i<=y;i++)

	{

		int dlt=query(q[i].x1-1,q[i].y1-1)+query(q[i].x2,q[i].y2)-query(q[i].x1-1,q[i].y2)-query(q[i].x2,q[i].y1-1);

		if(q[i].k<=dlt) t[tl++]=q[i];

		else q[i].k-=dlt,t[tr--]=q[i];

	}

	for(int i=x;i<=y;i++) q[i]=t[i];

	for(int i=l;i<=mid;i++) update(a[i].x,a[i].y,-1);

	solve(x,tr,l,mid); solve(tl,y,mid+1,r);

}

int main()

{

	n=rd(),m=rd(); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++)

	{

		int id=(i-1)*n+j;

		a[id].val=rd(); a[id].x=i,a[id].y=j;

	}

	sort(a+1,a+n*n+1,cmp);

	for(int i=1;i<=m;i++) q[i].x1=rd(),q[i].y1=rd(),q[i].x2=rd(),q[i].y2=rd(),q[i].k=rd(),q[i].id=i;

	solve(1,m,1,n*n);

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

	return 0;

}