#include<bits/stdc++.h>
#define fi first
#define se second
#define MULT_TEST 0
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
const int N = 9;
struct node {
    int n, HP[N], ATK[N], cnt[N];
    node() {}
    node(int n) : n(n) { memset(cnt, 0, sizeof(cnt)); }
    inline int size() {
        int sz = 0;
        for (int i = 1; i <= n; i++) sz += (HP[i] > 0);
        return sz;
    }
    inline int pos() {
        int mn = INF;
        for (int i = 1; i <= n; i++) 
            if (HP[i] > 0) mn = min(mn, cnt[i]);
        for (int i = 1; i <= n; i++) 
            if (HP[i] > 0 && cnt[i] == mn) return cnt[i]++, i;
        return -1;
    }
};
ldb ans1 = 0.0, ans2 = 0.0, ans3 = 0.0;
inline void DFS(int op, node A, node B, ldb P) {
    if (A.size() == 0 || B.size() == 0) {
        if (A.size() == 0 && B.size() == 0) ans3 += P;
        else if (A.size() == 0) ans2 += P;
        else ans1 += P;
        return ;
    }
    if (op == 0) {
        int pos = A.pos(), sz = B.size();
        for (int i = 1; i <= B.n; i++) {
            if (B.HP[i] <= 0) continue;
            B.HP[i] -= A.ATK[pos];
            A.HP[pos] -= B.ATK[i];
            DFS(op ^ 1, A, B, P / sz);
            B.HP[i] += A.ATK[pos];
            A.HP[pos] += B.ATK[i];
        }
    }
    else {
        int pos = B.pos(), sz = A.size();
        for (int i = 1; i <= A.n; i++) {
            if (A.HP[i] <= 0) continue;
            A.HP[i] -= B.ATK[pos];
            B.HP[pos] -= A.ATK[i];
            DFS(op ^ 1, A, B, P / sz);
            A.HP[i] += B.ATK[pos];
            B.HP[pos] += A.ATK[i];
        }
    }
}
inline void Solve() {
    int n, m;
    n = read(), m = read();
    node Ta(n), Tb(m);
    for (int i = 1; i <= n; i++) Ta.HP[i] = Ta.ATK[i] = read();
    for (int i = 1; i <= m; i++) Tb.HP[i] = Tb.ATK[i] = read();
    if (n > m) DFS(0, Ta, Tb, 1.0);
    else if (n < m) DFS(1, Ta, Tb, 1.0);
    else DFS(0, Ta, Tb, 0.5), DFS(1, Ta, Tb, 0.5);
    printf("%.12Lf\n%.12Lf\n%.12Lf\n", ans1, ans2, ans3);
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}