#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define int long long

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> ah(n), ak(n), bh(m), bk(m);
    vector<int> deada(n), deadb(m), aknum(n), bknum(m);
    for(int i = 0; i < n; i++) {
        cin >> ah[i];
        ak[i] = ah[i];
    }
    for(int i = 0; i < m; i++) {
        cin >> bh[i];
        bk[i] = bh[i];
    }
    ld ansa = 0, ansb = 0, ans = 0;
    auto dfs = [&](auto self, int al, int bl, int sa, int sb, ld now, int cur) -> void {
        if(sa == 0 && sb > 0) {
            ansb += now;
        } else if(sa > 0 && sb == 0) {
            ansa += now;
        } else if(sa == sb && sa == 0) {
            ans += now;
        } else {
            if(cur == 1) {
                int z = al;
                for(int i = n - 1; i >= 0; i--) {
                    if(deada[i]) continue;
                    if(aknum[i] <= aknum[z]) {
                        z = i;
                    }
                }

                for(int i = bl; i < m; i++) {
                    if(deadb[i]) continue;

                    int nak = ak[z];
                    int nah = ah[z];
                    int nbk = bk[i];
                    int nbh = bh[i];
                    int nal = al;
                    int nbl = bl;
                    int nsa = sa;
                    int nsb = sb;
                    int nda = deada[z];
                    int ndb = deadb[i];
                    int nz = z;

                    ah[z] -= bk[i];
                    bh[i] -= ak[z];
                    aknum[z]++;
                    // bknum[i]++;

                    if(ah[z] <= 0 && bh[i] <= 0) {
                        deada[z] = 1;
                        deadb[i] = 1;
                        sa--, sb--;
                        while(al < n && deada[al]) al++;
                        while(bl < m && deadb[bl]) bl++;
                        self(self, al, bl, sa, sb, now / (1.0 * nsb), 1 - cur);
                    } else if(ah[z] <= 0) {    
                        deada[z] = 1;
                        sa--;
                        while(al < n && deada[al]) al++;
                        while(bl < m && deadb[bl]) bl++;
                        self(self, al, bl, sa, sb, now / (1.0 * nsb), 1 - cur);
                    } else if(bh[i] <= 0) {
                        deadb[i] = 1;
                        sb--;
                        while(al < n && deada[al]) al++;
                        while(bl < m && deadb[bl]) bl++;
                        self(self, al, bl, sa, sb, now / (1.0 * nsb), 1 - cur);
                    }

                    z = nz;
                    aknum[z]--;
                    // bknum[i]--;
                    al = nal;
                    bl = nbl;
                    ak[z] = nak;
                    ah[z] = nah;
                    bk[i] = nbk;
                    bh[i] = nbh;
                    sa = nsa;
                    sb = nsb;
                    deada[z] = nda;
                    deadb[i] = ndb;   
                }
            } else {
                int z = bl;
                for(int i = m - 1; i >= 0; i--) {
                    if(deadb[i]) continue;
                    if(bknum[i] <= bknum[z]) {
                        z = i;
                    }
                }

                for(int i = al; i < n; i++) {
                    if(deada[i]) continue;

                    int nak = ak[i];
                    int nah = ah[i];
                    int nbk = bk[z];
                    int nbh = bh[z];
                    int nal = al;
                    int nbl = bl;
                    int nsa = sa;
                    int nsb = sb;
                    int nda = deada[i];
                    int ndb = deadb[z];
                    int nz = z;

                    ah[i] -= bk[z];
                    bh[z] -= ak[i];
                    // aknum[i]++;
                    bknum[z]++;

                    if(ah[i] <= 0 && bh[z] <= 0) {
                        deada[i] = 1;
                        deadb[z] = 1;
                        sa--, sb--;
                        while(al < n && deada[al]) al++;
                        while(bl < m && deadb[bl]) bl++;
                        self(self, al, bl, sa, sb, now / (1.0 * nsa), 1 - cur);
                    } else if(ah[i] <= 0) {    
                        deada[i] = 1;
                        sa--;
                        while(al < n && deada[al]) al++;
                        while(bl < m && deadb[bl]) bl++;
                        self(self, al, bl, sa, sb, now / (1.0 * nsa), 1 - cur);
                    } else if(bh[z] <= 0) {
                        deadb[z] = 1;
                        sb--;
                        while(al < n && deada[al]) al++;
                        while(bl < m && deadb[bl]) bl++;
                        self(self, al, bl, sa, sb, now / (1.0 * nsa), 1 - cur);
                    }
                    z = nz;
                    // aknum[i]--;
                    bknum[z]--;
                    al = nal;
                    bl = nbl;
                    ak[i] = nak;
                    ah[i] = nah;
                    bk[z] = nbk;
                    bh[z] = nbh;
                    sa = nsa;
                    sb = nsb;
                    deada[i] = nda;
                    deadb[z] = ndb;   
                }
            }
            
        }
    };
    if(n == m) {
        dfs(dfs, 0, 0, n, m, 0.5, 0);
        dfs(dfs, 0, 0, n, m, 0.5, 1);
    } else if(n > m) {
        dfs(dfs, 0, 0, n, m, 1, 1);
    } else {
        dfs(dfs, 0, 0, n, m, 1, 0);
    }
    cout << ansa << "\n";
    cout << ansb << "\n";
    cout << ans << "\n";
}          
    
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cout << fixed << setprecision(10);
    int T = 1;
    // cin >> T;
    while(T--) solve();

    return 0;
}