#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)

int main() {
    map<string, int> mp;
    int coin[5];
    rep(i, 5) { string str; cin >> str; mp[str] = i; cin >> coin[i]; }
    int n[3];
    vector<string> can[3];
    rep(i, 3) {
        cin >> n[i];
        rep(j, n[i]) { string str; cin >> str; can[i].eb(str); }
    }
    int acc[5] = {0};
    rep(i, n[0]) rep(j, n[1]) rep(k, n[2]) {
        string c00 = can[0][i];
        string c01 = can[0][(i + 1) % n[0]];
        string c02 = can[0][(i + 2) % n[0]];
        string c10 = can[1][j];
        string c11 = can[1][(j + 1) % n[1]];
        string c12 = can[1][(j + 2) % n[1]];
        string c20 = can[2][k];
        string c21 = can[2][(k + 1) % n[2]];
        string c22 = can[2][(k + 2) % n[2]];
        
        if (c00 == c10 && c10 == c20) acc[mp[c00]]++;
        if (c01 == c11 && c11 == c21) acc[mp[c01]]++;
        if (c02 == c12 && c12 == c22) acc[mp[c02]]++;
        if (c00 == c11 && c11 == c22) acc[mp[c00]]++;
        if (c02 == c11 && c11 == c20) acc[mp[c02]]++;
    }
    int tmp = 0;
    rep(i, 5) {
        tmp += acc[i] * coin[i];
    }
    out(fixed << setprecision(7) << (double)tmp / (n[0] * n[1] * n[2]));
    rep(i, 5) {
        out(acc[i]);
    }
}