#include <cstring>

#include <cstdio>

#include <algorithm>

#include <cmath>

#include <cstdlib>

using namespace std;

const int M=105,N=M*10000;

int Case,n,m,p[M],root[M],v1=0,v0=0;

int ls[N],rs[N],npl[N],val[N],cnt;

void makeheap(int x,int v){

	ls[x]=rs[x]=npl[x]=0;

	val[x]=v;

}

int merge(int a,int b){

	if (!a||!b)

		return a+b;

	if (val[a]<val[b])

		swap(a,b);

	rs[a]=merge(rs[a],b);

	if (npl[rs[a]]>npl[ls[a]])

		swap(rs[a],ls[a]);

	npl[a]=npl[rs[a]]+1;

	return a;

}

void pop(int &rt){

	rt=merge(ls[rt],rs[rt]);

}

void change(int &rt,int v){

	int x=merge(ls[rt],rs[rt]);

	makeheap(rt,v);

	rt=merge(rt,x);

}

int main(){

	scanf("%d",&Case);

	while (Case--){

		cnt=0;

		scanf("%d%d",&n,&m);

		for (int i=1;i<=m;i++)

			scanf("%d",&p[i]);

		memset(root,0,sizeof root);

		for (int i=1;i<=m;i++)

			for (int j=1,x;j<=p[i];j++){

				scanf("%d",&x);

				makeheap(++cnt,x);

				root[i]=merge(root[i],cnt);

			}

		int x[2],rt[2];

		memset(rt,0,sizeof rt);

		memset(x,0,sizeof x);

		for (int i=1;i<=n;i++){

			char op[2];

			int a;

			scanf("%s",op);

			if (op[0]=='T'){

				scanf("%d",&a);

				rt[i&1]=merge(rt[i&1],root[a]);

				x[i&1]+=p[a];

			}

			if (op[0]=='C'){

				if (val[rt[0]]==val[rt[1]])

					continue;

				if (val[rt[0]]>val[rt[1]]){

					x[0]+=x[1];

					x[1]=0;

					rt[0]=merge(rt[0],rt[1]);

					rt[1]=0;

				}

				else {

					x[1]+=x[0];

					x[0]=0;

					rt[1]=merge(rt[1],rt[0]);

					rt[0]=0;

				}

			}

			if (op[0]=='L'){

				pop(rt[i&1]);

				x[i&1]--;

			}

			if (op[0]=='A'){

				scanf("%d",&a);

				change(rt[i&1],val[rt[i&1]]+a);

			}

			if (op[0]=='E'){

				scanf("%d",&a);

				change(rt[i&1],a);

			}

		}

		printf("%d:%d\n",x[1],x[0]);

		if (x[1]>=x[0])

			v1++;

		else

			v0++;

	}

	puts(v1<v0?"I will be back!!":"Hahaha...I win!!");

	return 0;

}