#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) ((y)<0||(x)<0||(y)>=(h)||(x)>=(w))
#define dump(...)
const signed INF_=1001001001; const ll INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct{template<class T> operator T(){T x;cin>>x;return x;}} IN;
struct before_main_function {
    before_main_function() {
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

signed main() {
    map<string,int> id;
    vector<int> coin(5);
    REP(i,5) {
        string s;
        int c;
        cin>>s>>c;
        id[s]=i;
        coin[i]=c;
    }
    vector<int> nx(3);
    vector<map<vector<int>,int>> cnt(3);
    REP(i,3) {
        cin>>nx[i];
        vector<int> A;
        REP(j,nx[i]) {
            string s;
            cin>>s;
            A.push_back(id[s]);
        }
        REP(j,nx[i]) {
            vector<int> tmp;
            REP(k,3) tmp.push_back(A[(j+k)%nx[i]]);
            if(!CONTAIN(cnt[i],tmp)) cnt[i][tmp]=1;
            else cnt[i][tmp]++;
        }
    }

    double ans=0;
    vector<int> task2(5,0);
    vector<vector<int>> b(3);
    function<void(int)> dfs=[&](int i) {
        if(i==3) {
            REP(j,3) {
                if(!CONTAIN(cnt[j],b[j])) {
                    return;
                }
            }

            int score=0;
            int num=1;
            REP(j,3) num*=cnt[j][b[j]];
            REP(j,3) {
                bool same=true;
                REP(k,2) {
                    if(b[k][j]!=b[k+1][j]) {
                        same=false;
                    }
                }
                if(same) {
                    task2[b[0][j]]+=num;
                    score+=coin[b[0][j]];
                }
            }
            if(b[0][0]==b[1][1] && b[1][1]==b[2][2]) {
                task2[b[0][0]]+=num;
                score+=coin[b[0][0]];
            }
            if(b[0][2]==b[1][1] && b[1][1]==b[2][0]) {
                task2[b[0][2]]+=num;
                score+=coin[b[0][2]];
            }
            ans+=num*score/(double)(nx[0]*nx[1]*nx[2]);
            return;
        }
        REP(j,5) {
            REP(k,5) {
                REP(l,5) {
                    b[i]={j,k,l};
                    dfs(i+1);
                }
            }
        }
    };
    dfs(0);

    cout<<ans<<endl;
    REP(i,5) {
        cout<<task2[i]<<endl;
    }
    return 0;
}