import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

stof={}
ss=[]
cc=[]
for _ in range(5):
    s,c=SI().split()
    stof[s]=[0,0,0]
    ss.append(s)
    cc.append(int(c))

tot=1
for i in range(3):
    n=II()
    tot*=n
    for _ in range(n):
        s=SI()
        stof[s][i]+=1

ans=[]
ev=0
for s,c in zip(ss,cc):
    cur=1
    for i in range(3):
        cur*=stof[s][i]
    ans.append(cur*5)
    ev+=c*cur*5/tot

print(ev)
print(*ans,sep="\n")