uva11468

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 405, maxm = 70;

int ch[maxn][maxm],fail[maxn],tot,m;
bool tail[maxn], vis[maxn][105];
double p[70],dp[maxn][105];
string str[21];
map<char, int> mmp;

static auto speedup = []() {ios::sync_with_stdio(false); cin.tie(nullptr); return nullptr; }();
void Init() {
	tot = 0;
	memset(ch, 0, sizeof(ch));
	memset(tail, 0, sizeof(tail));
	memset(vis, 0, sizeof(vis));
	memset(p, 0, sizeof(p));
	memset(fail, 0, sizeof(fail));
	mmp.clear();
}

void Insert(string& input) {
	int len = input.size(),cur = 0;
	for (int i = 0; i < len; i++) {
		int index = mmp[input[i]];
		if (!ch[cur][index]) ch[cur][index] = ++tot;
		cur = ch[cur][index];
	}
	tail[cur] = 1;
}

void GetFail() {
	queue<int> q;
	for (int i = 0; i < m; i++) {
		if (ch[0][i]) {
			q.push(ch[0][i]);
		}
	}

	while (!q.empty()) {
		int cur = q.front();
		q.pop();

		for (int i = 0; i < m; i++) {
			int son = ch[cur][i];
			if (son) {
				fail[son] = ch[fail[cur]][i];
				tail[son] |= tail[fail[son]];
				q.push(son);
			}
			else {
				ch[cur][i] = ch[fail[cur]][i];
			}
		}
	}
}
double Getdp(int u, int l) {
	if (!l) return 1.0;
	if (vis[u][l]) return dp[u][l];
	vis[u][l] = 1;
	double& ans = dp[u][l];
	ans = 0;
	for (int i = 0; i < m; i++) {
		if (!tail[ch[u][i]]) {
			ans += p[i] * Getdp(ch[u][i],l - 1);
		}
	}
	return ans;
}
int main() {
	int t;
	cin >> t;
	for (int kCase = 1; kCase <= t; kCase++) {
		Init();
		int k;
		string input;
		cin >> k;
		for (int i = 0; i < k; i++) {
			cin >> str[i];
		}
		cin >> m;
		for (int i = 0; i < m; i++) {
			char tmp;
			cin >> tmp >> p[i];
			mmp[tmp] = i;
		}
		for (int i = 0; i < k; i++) {
			Insert(str[i]);
		}
		GetFail();
		int l;
		cin >> l;
		cout << "Case #" << kCase << ": ";
		cout << fixed << setprecision(6) << Getdp(0, l) << endl;

	}
	return 0;
}