#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

string types[5];
int returns[5];
map<string, int> cnt[3];
ll cnt2[5];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    for(int i=0;i<5;++i){
        std::cin >> types[i] >> returns[i];
    }

    ll pr = 1;
    for(int i=0;i<3;++i){
        int n;
        std::cin >> n;

        pr *= n;
        
        for(int j=0;j<n;++j){
            string type;
            std::cin >> type;

            ++cnt[i][type];
        }
    }

    double ex = 0;
    for(int i=0;i<5;++i){
        cnt2[i] = 1ll * cnt[0][types[i]] * cnt[1][types[i]] * cnt[2][types[i]] * 5;
        ex += 1. * cnt2[i] * returns[i];
    }

    ex /= pr;

    printf("%.10f\n", ex);

    for(int i=0;i<5;++i){
        printf("%lld\n", cnt2[i]);
    }
}