#include <stdio.h>
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <stdlib.h>


#define LENGTH(x) (sizeof(x)/sizeof(*(x)))
#define CLEAR(x) memset(x,0,sizeof(*x))

int N,Ni,i,j,k;

struct herec {
	int num;
	int role[100];
	char name[100];
	} herec[150];
char role[150][100];

struct state {
	char uherci[150];
	char urole[150];
	int rrole;
};

int H,R,A;

int compherec(struct herec *h1,struct herec *h2)
{
	return(-(h2->num-h1->num));
}	

int ok=0;

void try(struct state local)
{
int i,j;

	for (i=0;i<H;i++) {
		if (local.uherci[i])
			continue;
		for (j=0;j<herec[i].num;j++) {
			if (local.urole[herec[i].role[j]])
				continue;
			local.uherci[i]=1;
			local.urole[herec[i].role[j]]=1;
			if (!--local.rrole) {
				ok=1;
				return;
				}
			try(local);
			if (ok)
				return;
			local.uherci[i]=0;
			local.urole[herec[i].role[j]]=0;
			local.rrole++;
			}
		}
}

int main(void)
{
	scanf("%d",&N);
	for (Ni=0;Ni<N;Ni++) {
struct state initstate;
char cur[100],curr[100];
int curN,q;

		scanf("%d%d%d",&H,&R,&A);
		for (i=0;i<H;i++) {
			scanf("%s",herec[i].name);
			herec[i].num=0;
			}
		for (i=0;i<R;i++) {
			scanf("%s",role[i]);
			}
		for (i=0;i<H;i++) {
			scanf("%s%d",cur,&curN);
			for (q=0;q<H;q++)
				if (!strcmp(cur,herec[q].name))
						break;
			for (j=0;j<curN;j++) {
				scanf("%s",curr);
				for (k=0;k<R;k++)
					if (!strcmp(role[k],curr))
						break;
				herec[q].role[herec[q].num++]=k;
				}
			}
		for (q=0;q<A;q++) {
			scanf("%s",cur);
			for (i=0;i<H;i++)
				if (!strcmp(cur,herec[i].name))
						break;
			herec[i]=herec[H-1];
			H--;
			}
		if (!R)
			ok=1;
		else {
			qsort(herec,H,sizeof(*herec),(int (*)(const void *,const void *))compherec);
			CLEAR(&initstate);	
			initstate.rrole=R;
			ok=0;
			try(initstate);
			}
		if (ok)
			puts("Premiera bude!");
		else puts("Zatraceni demonstranti!");
		} 
	return(0);
}