#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

string egara[5];
int coins[5];

int n[3];
string rrr[3][5252];

int ids[3][5252];
int idscnt[3][5];

int main(){
  REP(i,5)cin>>egara[i]>>coins[i];
  REP(i,3){
    cin>>n[i];
    REP(j,n[i])cin>>rrr[i][j];
    REP(j,n[i]){
      ids[i][j] = -1;
      REP(k,5)if(rrr[i][j]==egara[k]){
        ids[i][j] = k;
        idscnt[i][k]++;
      }
    }
  }
  ll ans[5] = {0,0,0,0,0};
  REP(i,n[0])REP(j,n[1]){
    int lu = i, lm = (i+1)%n[0], ld = (i+2)%n[0];
    int ru = j, rm = (j+1)%n[1], rd = (j+2)%n[1];
    if(ids[0][lu] == ids[1][ru]){
      int k = ids[0][lu];
      if(k!=-1)ans[k] += idscnt[2][k];
    }
    if(ids[0][lm] == ids[1][rm]){
      int k = ids[0][lm];
      if(k!=-1)ans[k] += idscnt[2][k];
    }
    if(ids[0][ld] == ids[1][rd]){
      int k = ids[0][ld];
      if(k!=-1)ans[k] += idscnt[2][k];
    }
    if(ids[0][lu] == ids[1][rm]){
      int k = ids[0][lu];
      if(k!=-1)ans[k] += idscnt[2][k];
    }
    if(ids[0][ld] == ids[1][rm]){
      int k = ids[0][ld];
      if(k!=-1)ans[k] += idscnt[2][k];
    }
  }
  double aaa = 0.0;
  REP(i,5)aaa += ans[i] * coins[i];
  REP(i,3)aaa /= n[i];
  printf("%.9f\n",aaa);
  REP(i,5)printf("%lld\n",ans[i]);
  return 0;
}