#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cctype>

#include<cstdlib>

#define maxr 220

#define maxc 550000

#define maxv 1000

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

int d[maxr][maxr][maxv+],s[maxr][maxr][maxv+];

int tree[maxc*],root[maxc],ls[maxc*],rs[maxc*],tot,size[maxc*];

int q[maxr][maxr];

int r,c,m;

int asks(int xa,int ya,int xb,int yb,int x){    return d[xb][yb][x]-d[xa-][yb][x]-d[xb][ya-][x]+d[xa-][ya-][x];    }

int askn(int xa,int ya,int xb,int yb,int x){    return s[xb][yb][x]-s[xa-][yb][x]-s[xb][ya-][x]+s[xa-][ya-][x];    }

void solve1(){

    for(int i=;i<=r;++i)

        for(int j=;j<=c;++j)    q[i][j]=read();

    for(int k=;k<=maxv;++k)

        for(int i=;i<=r;++i)

            for(int j=;j<=c;++j){

                bool flag=;

                if(q[i][j]<k)    flag=;;

                d[i][j][k]=d[i-][j][k]+d[i][j-][k]-d[i-][j-][k]+(flag==?q[i][j]:);

                s[i][j][k]=s[i-][j][k]+s[i][j-][k]-s[i-][j-][k]+(flag==?:);

            }

    while(m--){

        int xa=read(),ya=read(),xb=read(),yb=read(),x=read();

        if(asks(xa,ya,xb,yb,)<x){

            printf("Poor QLW\n");

            continue;

        }

        int lef=,rig=maxv,ans=-;

        while(lef<=rig){

            int mid=(lef+rig)>>;

            //printf("%d>>>%d\n",asks(xa,ya,xb,yb,mid),mid);

            if(asks(xa,ya,xb,yb,mid)>=x){

                ans=mid;

                lef=mid+;

            }

            else    rig=mid-;

        }

        if(ans==-)    printf("Poor QLW\n");

        else        printf("%d\n",askn(xa,ya,xb,yb,ans)-(asks(xa,ya,xb,yb,ans)-x)/ans);

    }

}

inline void update(int &o,int last,int lef,int rig,int p){

    o=++tot;    ls[o]=ls[last];    rs[o]=rs[last];    tree[o]=tree[last]+p;    size[o]=size[last]+;

    if(lef==rig)    return;

    int mid=(lef+rig)>>;

    if(p<=mid)    update(ls[o],ls[last],lef,mid,p);

    else        update(rs[o],rs[last],mid+,rig,p);

}

void solve2(){

    for(int i=;i<=c;++i){

        int x=read();

        update(root[i],root[i-],,maxv,x);

    }

    while(m--){

        int xa=read(),ya=read(),xb=read(),yb=read(),x=read();

        if(tree[root[yb]]-tree[root[ya-]]<x){

            printf("Poor QLW\n");

            continue;

        }

        register int lef=,rig=maxv,a=root[ya-],b=root[yb],ans=;

        while(lef<rig){

            register int mid=(lef+rig)>>;

            if(tree[rs[b]]-tree[rs[a]]>=x){

                lef=mid+;

                a=rs[a];    b=rs[b];

            }

            else{

                x-=tree[rs[b]]-tree[rs[a]];

                ans+=size[rs[b]]-size[rs[a]];

                rig=mid;

                a=ls[a];    b=ls[b];

            }

        }

        ans+=(x+lef-)/lef;

        printf("%d\n",ans);

    }

    return;

}

int main(){

    r=read(),c=read(),m=read();

    if(r!=)    solve1();

    else        solve2();

    return ;

}