#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
int t,n,k,a,ans,l_length;
	string s;
	string b;
vector<int>hh;
vector<string>ee;
vector<string>aa;
int work(){


	freopen("substrings.in","r",stdin);
	freopen("substrings.out","w",stdout);
	scanf("%d",&t);
    for(int j=1;j<=t;j++)
	{
	scanf("%d",&k);
	for(int i=1;i<=k;i++)
	{
		cin>>s;
		ee.push_back(s);
	}
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		cin>>b>>a;
		aa.push_back(b);
		hh.push_back(a);
	}
	scanf("%d",&l_length);
		if(k==n==1)
	{
		if(ee[1]==aa[1])
		{
			ans=0;
		}
		else
		{
			ans=1;
		}
	}
	else
	{
	    ans=1;
		for(int i=1;i<=hh.size();i++)
		ans=1-ans*hh[i];
	}
	printf("Case #");
	printf("%d",j);
	printf(":");
	printf("%.6f",ans);
	}
}

int main()
{
	   work(); 
	return 0;
	}