#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 cnt[5] = {};
	rep(i, n[0]) {
		rep(j, n[1]) {
			rep(k, n[2]) {
				int slot[3][3];
				int ijk[3] = { i, j, k };
				rep(s, 3) {
					rep(t, 3) {
						slot[s][t] = A[s][(ijk[s] + t) % n[s]];
					}
				}
				rep(s, 3) {
					if (slot[0][s] == slot[1][s] && slot[1][s] == slot[2][s]) {
						cnt[slot[0][s]]++;
					}
				}
				if (slot[0][0] == slot[1][1] && slot[1][1] == slot[2][2]) {
					cnt[slot[0][0]]++;
				}
				if (slot[0][2] == slot[1][1] && slot[1][1] == slot[2][0]) {
					cnt[slot[0][2]]++;
				}
			}
		}
	}
	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;
}