#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000


int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	string str[5];
	int coin[5];
	rep(i, 5) cin >> str[i] >> coin[i];
	int n[3];
	int A[3][5000];
	rep(i, 3) {
		cin >> n[i];
		rep(j, n[i]) {
			string S; cin >> S;
			rep(r, 5) if (S == str[r]) A[i][j] = r;
		}
	}
	int state[3][5][5][5];
	rep(i, 3) rep(j, 5) rep(s, 5) rep(t, 5) state[i][j][s][t] = 0;
	rep(i, 3) {
		rep(j, n[i]) {
			state[i][A[i][j % n[i]]][A[i][(j + 1) % n[i]]][A[i][(j + 2) % n[i]]]++;
		}
	}
	int cnt[5] = {};
	rep(i0, 5) rep(j0, 5) rep(k0, 5){
		rep(i1, 5) rep(j1, 5) rep(k1, 5) {
			rep(i2, 5) rep(j2, 5) rep(k2, 5) {
				if (i0 == j0 && j0 == k0) cnt[i0] += state[0][i0][i1][i2] * state[1][j0][j1][j2] * state[2][k0][k1][k2];
				if (i1 == j1 && j1 == k1) cnt[i1] += state[0][i0][i1][i2] * state[1][j0][j1][j2] * state[2][k0][k1][k2];
				if (i2 == j2 && j2 == k2) cnt[i2] += state[0][i0][i1][i2] * state[1][j0][j1][j2] * state[2][k0][k1][k2];
				if (i0 == j1 && j1 == k2) cnt[i0] += state[0][i0][i1][i2] * state[1][j0][j1][j2] * state[2][k0][k1][k2];
				if (i2 == j1 && j1 == k0) cnt[i2] += state[0][i0][i1][i2] * state[1][j0][j1][j2] * state[2][k0][k1][k2];
			}
		}
	}
	ll sum = 0;
	rep(i, 5) {
		sum += cnt[i] * coin[i];
	}
	cout << sum / (double)(n[0] * n[1] * n[2]) << endl;
	rep(i, 5) {
		cout << cnt[i] << endl;
	}

    return 0;
}