import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum L = 5;
enum M = 3;

void main() {
  try {
    for (; ; ) {
      auto S = new string[L];
      auto C = new real[L];
      foreach (i; 0 .. L) {
        S[i] = readToken();
        C[i] = readInt();
      }
      auto N = new int[M];
      auto A = new string[][M];
      foreach (x; 0 .. M) {
        N[x] = readInt();
        A[x] = new string[N[x]];
        foreach (y; 0 .. N[x]) {
          A[x][y] = readToken();
        }
      }
      
      int[string] tr;
      foreach (i; 0 .. L) {
        tr[S[i]] = i;
      }
      auto freq = new int[][](L, M);
      foreach (x; 0 .. M) {
        foreach (y; 0 .. N[x]) {
          ++freq[tr[A[x][y]]][x];
        }
      }
      auto ans = new long[L];
      foreach (i; 0 .. L) {
        ans[i] = 5;
        foreach (x; 0 .. M) {
          ans[i] *= freq[i][x];
        }
      }
      real total = 0.0;
      foreach (i; 0 .. L) {
        total += ans[i] * C[i];
      }
      foreach (x; 0 .. M) {
        total /= N[x];
      }
      writefln("%.10f", total);
      foreach (i; 0 .. L) {
        writeln(ans[i]);
      }
    }
  } catch (EOFException e) {
  }
}