#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  map<string, int> mp;
  vector<int> coin(5);
  REP(i, 5) {
    string s; cin >> s >> coin[i];
    mp[s] = i;
  }
  vector<int> n(3);
  vector<vector<string> > a(3);
  REP(i, 3) {
    cin >> n[i];
    a[i].resize(n[i]);
    REP(j, n[i]) cin >> a[i][j];
  }
  REP(i, 2) REP(j, 2) a[i].emplace_back(a[i][j]);
  vector<int> cnt(5, 0);
  REP(i, n[2]) ++cnt[mp[a[2][i]]];
  vector<ll> u(5, 0);
  REP(i, n[0]) REP(j, n[1]) {
    REP(k, 3) {
      if (a[0][i + k] == a[1][j + k]) u[mp[a[0][i + k]]] += cnt[mp[a[0][i + k]]];
    }
    if (a[0][i] == a[1][j + 1]) u[mp[a[0][i]]] += cnt[mp[a[0][i]]];
    if (a[0][i + 2] == a[1][j + 1]) u[mp[a[0][i + 2]]] += cnt[mp[a[0][i + 2]]];
  }
  double A = 0;
  REP(i, 5) A += u[i] * coin[i];
  REP(i, 3) A /= n[i];
  cout << A << '\n';
  REP(i, 5) cout << u[i] << '\n';
  return 0;
}