#include <stdio.h>
#include <stdlib.h>

#define MAX 30

int c,n,x,y;
FILE * file;

int count;



struct ps { int x; int y; int X; int Y; };
struct ps PS[MAX];

int PS2[MAX][MAX+2];

int fillPS2(int x, int y, int idx) {
 int a;
 for(a=0;a<n;a++) if ((x<PS[a].X) && (x>PS[a].x) && (y<PS[a].Y) && (y>PS[a].y)) { PS2[a][MAX]++; PS2[a][idx]=1; }
 return 0;
}

int main () {
 int c=0;
 int a,b,p,o,q,test,test2;
 file=fopen("slides.in","rt");
 while (1) {
  fscanf(file,"%i\n",&n);
  if (!n) break;
  c++;
  for (a=0;a<MAX;a++) for(b=0; b<(MAX+2); b++) PS2[a][b]=0;
  for (a=0;a<n;a++) fscanf(file,"%i %i %i %i\n",&PS[a].x,&PS[a].X,&PS[a].y,&PS[a].Y);
  for (a=0;a<n;a++) {
   fscanf(file,"%i %i\n",&x,&y);
   fillPS2(x,y,a);
  }
  
  test=1; p=n;
  while ((p) && (test)) {
   o=n; test2=1;
   p--;
   while ((o) && (test2)) {
    o--;
    if (PS2[o][MAX]==1) test2=0;
   }

   if (test2) { test=0; p=n; } 
   else {
    for(q=0;q<n;q++) if (PS2[o][q]==1) PS2[o][MAX+1]=q;
    for(q=0;q<n;q++) if (PS2[q][PS2[o][MAX+1]]==1) { PS2[q][PS2[o][MAX+1]]=0; PS2[q][MAX]--; }
   }
  }
  printf("Heap %i\n",c);
  if (p) printf("none\n"); 
  else { for(q=0;q<n;q++) printf("(%c,%i) ",(char)((int)'A'+q),(PS2[q][MAX+1]+1)); 
         printf("\n"); }

  printf("\n");
 }
 fclose (file);
 return 0;
}