#include<iostream>#include<string>using namespace std;

int link[30];int map[30][30];typedef struct node{int xmin;int xmax;int ymin;int ymax;}node;

node num[30];int n,m;int v[30];

int find(int x){for(int i=1;i<=n;i++)    {if(!v[i] && map[x][i])        {            v[i]=1;if(link[i]==0 || find(link[i]))            {                link[i]=x;return 1;            }        }    }return 0;}    

void solve(){int i;    memset(link,0,sizeof(link));for(i=1;i<=n;i++)    {        memset(v,0,sizeof(v));        find(i);    }}

int isok(int x,int y,int i){if(x>=num[i].xmin && x<=num[i].xmax && y>=num[i].ymin && y<=num[i].ymax)return 1;return 0;}

int main(){int i,j,a,b;m=1;    freopen("D:\\in.txt","r",stdin);while(scanf("%d",&n),n)    {for(i=1;i<=n;i++)        {            scanf("%d%d%d%d",&num[i].xmin,&num[i].xmax,&num[i].ymin,&num[i].ymax);        }        memset(map,0,sizeof(map));for(i=1;i<=n;i++)        {            scanf("%d%d",&a,&b);for(j=1;j<=n;j++)            {if(isok(a,b,j))                {                    map[i][j]=1; //左边代表数字，右边代表字母                }            }        }

//先任意求一次最大匹配        solve();        printf("Heap %d\n",m++);int flag=0;for(i=1;i<=n;i++)        {if(!link[i])continue;int temp=link[i];            link[i]=0;   //把位置腾出来            map[temp][i]=0; //同时把边删掉，这样就无法达到原来的匹配            memset(v,0,sizeof(v));if(!find(temp)) //如果没有新的匹配方案诞生，说明这是一条关键边            {if(flag)                    cout<<" ";                flag=1;                link[i]=temp;                printf("(%c,%d)",(char)(i+64),temp);            }            map[temp][i]=1; //把图复原        }if(!flag)        {            cout<<"none";        }        cout<<endl<<endl;    }return 0;}