#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define mt make_tuple
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum accumulate
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
void solve() {
	vv(ll, cnt, 5, 2, 1);
	vs no(5);
	string s;
	ll t;
	rep(i, 0, 5) {
		cin >> s >> t;
		cnt[i][0] = t;
		no[i] = s;
	}
	ll num = 1, n;
	rep(i, 0, 3) {
		map<string, ll> m;
		cin >> n;
		num *= n;
		rep(j, 0, n) {
			cin >> s;
			++m[s];
		}
		rep(j, 0, 5) {
			cnt[j][1] *= m[no[j]];
		}
	}
	ll ans = 0;
	rep(i, 0, 5) {
		ans += cnt[i][0] * cnt[i][1] * 5;
	}
	print(double(ans) / num);
	rep(i, 0, 5) {
		print(cnt[i][1] * 5);
	}
}
int main() {
	cout << setprecision(12) << fixed;
	solve();
	return 0;
}