#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define ull unsigned long long
#define sort stable_sort 
#define endl '\n'
const int inf=1000;
int a[210][210],b[500010],sum[210][210][1010],num[210][210][1010];
struct PDS_SMT
{
	int root[500010],rt_sum;
	struct SegmentTree
	{
		int ls,rs,siz,sum;
	}tree[500010<<5];
	#define lson(rt) (tree[rt].ls)
	#define rson(rt) (tree[rt].rs)
	int build_rt()
	{
		rt_sum++;
		lson(rt_sum)=rson(rt_sum)=tree[rt_sum].siz=tree[rt_sum].sum=0;
		return rt_sum;
	}
	void update(int pre,int &rt,int l,int r,int pos)
	{
		rt=build_rt();  tree[rt]=tree[pre];
		tree[rt].siz++;  tree[rt].sum+=pos;
		if(l==r)  return;
		int mid=(l+r)/2;	
		if(pos<=mid)  update(lson(pre),lson(rt),l,mid,pos);
		else  update(rson(pre),rson(rt),mid+1,r,pos);
	}
	int query(int rt1,int rt2,int l,int r,int val)
	{
		if(tree[rt2].sum-tree[rt1].sum<val)  return -1;
		if(l==r)  return ceil(1.0*val/l);
		int mid=(l+r)/2,sum=tree[rson(rt2)].sum-tree[rson(rt1)].sum;
		if(sum>=val)  return query(rson(rt1),rson(rt2),mid+1,r,val);
		return tree[rson(rt2)].siz-tree[rson(rt1)].siz+query(lson(rt1),lson(rt2),l,mid,val-sum);
	}
}T;
int query1(int x1,int y1,int x2,int y2,int k)
{
	return sum[x2][y2][k]-sum[x1-1][y2][k]-sum[x2][y1-1][k]+sum[x1-1][y1-1][k];
}
int query2(int x1,int y1,int x2,int y2,int k)
{
	return num[x2][y2][k]-num[x1-1][y2][k]-num[x2][y1-1][k]+num[x1-1][y1-1][k];
}
int main()
{
// #define Isaac
#ifdef Isaac
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	int n,m,q,x1,y1,x2,y2,h,l,r,ans,mid,i,j,k;
	cin>>n>>m>>q;
	if(n==1)
	{
		for(i=1;i<=m;i++) 
		{
			cin>>b[i];  T.update(T.root[i-1],T.root[i],1,inf,b[i]);
		}
		for(i=1;i<=q;i++)
		{
			cin>>x1>>y1>>x2>>y2>>h;
			ans=T.query(T.root[y1-1],T.root[y2],1,inf,h);
			if(ans!=-1)  cout<<ans<<endl;
			else  cout<<"Poor QLW"<<endl;
		}
	}
	else
	{
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=m;j++)
			{
				cin>>a[i][j];
				for(k=1;k<=inf;k++)
				{
					sum[i][j][k]=sum[i-1][j][k]+sum[i][j-1][k]-sum[i-1][j-1][k]+(a[i][j]>=k)*a[i][j];
					num[i][j][k]=num[i-1][j][k]+num[i][j-1][k]-num[i-1][j-1][k]+(a[i][j]>=k);
				}
			}
		}
		for(i=1;i<=q;i++)
		{
			cin>>x1>>y1>>x2>>y2>>h;
			l=1;  r=inf;  ans=-1;
			while(l<=r)
			{
				mid=(l+r)/2;
				if(query1(x1,y1,x2,y2,mid)>=h)
				{
					ans=mid;
					l=mid+1;
				}
				else  r=mid-1;
			}
			if(ans!=-1)  cout<<query2(x1,y1,x2,y2,ans+1)+ceil(1.0*(h-query1(x1,y1,x2,y2,ans+1))/ans)<<endl;
			else  cout<<"Poor QLW"<<endl;
		}
	}
	return 0;
}