#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    string S[5];
    int C[5];
    for ( int i = 0; i < 5; i++ ) {        
        cin >> S[i] >> C[i];
    }
    int N[3];
    vector< vector<long long> > A( 3, vector<long long>(5,0) );
    for ( int i = 0; i < 3; i++ ) {        
        cin >> N[i];
        for ( int j = 0; j < N[i]; j++ ) {
            string s;
            cin >> s;
            for ( int k = 0; k < 5; k++ ) {
                if ( S[k] == s ) { A[i][k]++; }
            }
        }
    }

    long long X[5] = {0};
    long long sum = 0;
    for ( int i = 0; i < 5; i++ ) {
        long long a = 1;
        for ( int j = 0; j < 3; j++ ) {
            a *= A[j][i];
        }
        X[i] = a*5;
        sum += X[i]*C[i];
    }

    long long n = 1;
    for ( int i = 0; i < 3; i++ ) {
        n *= N[i];
    }
 
    printf( "%.5f\n", static_cast<double>(sum) / static_cast<double>(n) );
    
    for ( int i = 0; i < 5; i++ ) {
        cout << X[i] << endl;
    }


    return 0;
}