#include <stdio.h>
#define MAXH 200 
#define MAXR 200 

int umi[MAXH][MAXR];
int kolik[MAXH];
int chybi[MAXH];

int herec[MAXR];
int role[MAXH];
char jm_herce[MAXH][40];
char jm_role[MAXR][40];

int cesta[MAXH+MAXR];
int proslo[MAXH];
int last;
int Z, H, R, A;

int najdi();
int prepoj();

int main () {
  int i, j, h, r;
  char s[40];

  scanf("%d", &Z);
  while (Z--) {
    scanf("%d %d %d", &H, &R, &A);
    for (i=0; i<H; i++)
      scanf("%s", jm_herce[i]);
    for (i=0; i<R; i++)
      scanf("%s", jm_role[i]);

/* nuluje */
    for (r=0; r<R; r++) 
      for (h=0; h<H; h++)
        umi[h][r] = 0;
    for (r=0; r<R; r++) herec[r] = -1;
    for (h=0; h<R; h++) {
      role[h] = -1;
      chybi[h] = 0;
    }

    for (i=0; i<H; i++) {
      scanf("%s", s);
      for (h=0; h<H; h++) 
        if (! strcmp(jm_herce[h], s)) break;
      scanf("%d", &kolik[h]);
      for (j=0; j < kolik[h]; j++) {
        scanf("%s", s);  /* CAS */
        for (r=0; r<R; r++)
          if (! strcmp(jm_role[r], s)) break;
        umi[h][r] = 1;
      }
    }
    for (i=0; i<A; i++) {
      scanf("%s", s);
      for (h=0; h<H; h++) 
        if (! strcmp(jm_herce[h], s)) break;
      chybi[h] = 1;
    }

    if ( H - A < R) {
      printf("Zatraceni demonstranti!\n");
      break; 
    }
    
    for (i=0; i<R; i++) herec[i] = -1;
    for (i=0; i<H; i++) role[i] = -1;
    for (i=0; i<H; i++) proslo[i] = 0;

    for (r = 0; r<R; r++) {
      /* pridej roli */
      last = 0;
      h = najdi(r);
      if (h == -1) break;
      prepoj(r);/**/
    }

    if (r == R) printf("Premiera bude!\n");
    else printf("Zatraceni demonstranti!\n");

/*
    for (r=0; r<R; r++)
      printf("%s %s\n", jm_role[r], jm_herce[herec[r]]);
*/

  }
  return 0; 
}


int najdi(int r) {
  int h, i;
  for (h = 0; h<H; h++)
    if (!proslo[h] && umi[h][r] && !chybi[h] && role[h] == -1) {
      cesta[last] = h;
      return h;
    }

  for (h = 0; h<H; h++)
    if (!proslo[h] && !chybi[h] && umi[h][r]) {
      cesta[last++] = h;
      proslo[h] = 1;
      i = najdi(role[h]);
      proslo[h] = 0;
      if (i != -1) {
        cesta[last] = i;
        return i;
      }
      else last--;
    }
  return (-1);
}

int prepoj(int r) {
  int i, h, pomr;
  for (i=0; i<=last; i++) {
    h = herec[r] = cesta[i];
    pomr = role[h];
    role[h] = r;
    r = pomr;
  }
  return 0;
}