#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(bstr(5); vectorcoin(5),ans(5); REP(i,5)cin>>str[i]>>coin[i]; ll N1,N2,N3; cin>>N1;vectorA(5);REP(i,N1){string s;cin>>s;REP(j,5)if(s==str[j])A[j]++;} cin>>N2;vectorB(5);REP(i,N2){string s;cin>>s;REP(j,5)if(s==str[j])B[j]++;} cin>>N3;vectorC(5);REP(i,N3){string s;cin>>s;REP(j,5)if(s==str[j])C[j]++;} REP(i,5)ans[i]=A[i]*B[i]*C[i]*5; ld E=0; REP(i,5)E+=ans[i]*coin[i]; printf("%.20llf\n",E/N1/N2/N3); REP(i,5)cout<