#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	map<string, int> conv;
	vector<int> coin(5);
	REP(i, 5) {
		string S;
		cin >> S >> coin[i];
		conv[S] = i;
	}
	int N[3];
	int cnt[3][5] {};
	REP(i, 3) {
		scanf("%d", &N[i]);
		REP(j, N[i]) {
			string S;
			cin >> S;
			++cnt[i][conv[S]];
		}
	}
	
	ll sum = 0, ans[5] {};
	REP(i, 5) {
		ll p = (ll)cnt[0][i] * cnt[1][i] * cnt[2][i] * 5;
		sum += p * coin[i];
		ans[i] += p;
	}
	
	printf("%.16f\n", (double)sum / ((ll)N[0] * N[1] * N[2]));
	REP(i, 5) cout << ans[i] << endl;
}