#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <map>
#include <string>

using namespace std;

const int N = 5;

int main() {
	array<int, N> cs, bs{5, 5, 5, 5, 5};
	vector<int> rs[3];
	map<string, int> m;

	for (int i = 0; i < N; i++) {
		string s;
		cin >> s >> cs[i];
		m[s] = i;
	}

	double n[3];
	for (int i = 0; i < 3; i++) {
		cin >> n[i];
		for (int j = 0; j < n[i]; j++) {
			string s;
			cin >> s;
			rs[i].emplace_back(m[s]);
		}
	}

	for (int i = 0; i < 5; i++) {
		int n[3];
		for (int j = 0; j < 3; j++){
			n[j] = count(rs[j].begin(), rs[j].end(), i);
		}
		for(const int& m : n){
			bs[i] *= m;
		};
	}


	double exp = 0;
	for (int i = 0; i < N; i++) {
		exp += cs[i] / n[0] * bs[i] / n[1];
	}
	exp /= n[2];

	cout << exp << endl;

	for (int i : bs) {
		cout << i << endl;
	}

	return 0;
}