#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define IN "slides.in"
#define debug if(0)printf
typedef struct {int x, y;} point;
#define DENTRO(a,b,c) (a.x>b.x&&a.x<c.x&&a.y>b.y&&a.y<c.y)
#define MAX 50

int nslide[MAX], nnumero[MAX], slide[MAX][MAX], numero[MAX][MAX];
int pareja[MAX];
point cmin[MAX], cmax[MAX], p;

int icmp(const void *p1, const void *p2){
	return *(int*)p1-*(int*)p2;
}


int main(void){
	int i, j, k, caso=0, n, npareja, fin;
	
	freopen(IN,"rt",stdin);
	debug("antes de entrar\n");
	while (scanf(" %d", &n), n){
		memset(nslide, 0, sizeof(nslide));
		memset(slide, 0, sizeof(slide));
		memset(numero, 0, sizeof(numero));
		memset(nnumero, 0, sizeof(nnumero));
		
		npareja=0;
		for (i=0; i<n; i++) 
			scanf(" %d %d %d %d", &cmin[i].x, &cmax[i].x,
				&cmin[i].y, &cmax[i].y);
		
		for (i=0; i<n; i++){
			scanf(" %d %d", &p.x, &p.y);
			for (j=0; j<n; j++){
				if (DENTRO(p, cmin[j], cmax[j])){
					numero[i][j]=slide[j][i]=1;
					nnumero[i]++; nslide[j]++;
					debug("dentro %d de %d\n", i, j);
				}
			}
		}

		debug("fin de entrada\n");
		fin=0;
		while (!fin){
			debug("hola\n");
			fin=1;
			for (i=0; i<n; i++){
				if (nnumero[i]==1){
					fin=0;
					for (j=0; j<n; j++) if (numero[i][j]) break;
					nnumero[i]=-1; nslide[j]=-1;
					pareja[npareja++]=100*j+i;
					for (k=0; k<n; k++){
						if (slide[k][i]){slide[k][i]=0;nslide[k]--;}
						if (numero[k][j]){numero[k][j]=0;nnumero[k]--;}
					}
				}
			}
			for (i=0; i<n; i++){
				if (nslide[i]==1){
					fin=0;
					for (j=0; j<n; j++) if (slide[i][j]) break;
					nnumero[j]=-1; nslide[i]=-1;
					pareja[npareja++]=100*i+j;
					for (k=0; k<n; k++){
						if (slide[k][j]){slide[k][j]=0;nslide[k]--;}
						if (numero[k][i]){numero[k][i]=0;nnumero[k]--;}
					}
				}
			}
							
		}
		printf("Heap %d\n", ++caso);
		qsort(pareja, npareja, sizeof(pareja[0]), icmp);
		if (npareja==0) printf("none\n");
		else{
			for (i=0; i<npareja; i++){
				if (!i) printf("(%c,%d)", 'A'+(pareja[i]/100), (pareja[i]%100)+1);
				else  printf(" (%c,%d)", 'A'+(pareja[i]/100), (pareja[i]%100)+1);

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