#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second

double aa = 0, bb = 0, tt = 0;
vector<int> a1(10), b1(10);

void rec(bool alice, int n, int m, double p, vector<int>& a, vector<int>& b, vector<int>& at, vector<int>& bt) {
    int neg = 0, hoyr = 0;
    
    for (int i = 0; i < n; i++) {
        if (a[i] > 0) neg++;
    }
    for (int i = 0; i < m; i++) {
        if (b[i] > 0) hoyr++;
    }

    if (neg == 0 || hoyr == 0) {
        if (neg == 0 && hoyr == 0) {
            tt += p;
            return;
        }
        if (neg == 0) {
            bb += p;
        } else {
            aa += p;
        }
        return;
    }

    if (alice) {
        int idx = -1, mn = INT_MAX;
        for (int i = n - 1; i >= 0; i--) {
            if (a[i] > 0 && at[i] <= mn) {
                mn = at[i];
                idx = i;
            }
        }

        double huvi = 0;
        for (int j = 0; j < m; j++) {
            if (b[j] > 0) huvi += 1.0;
        }
//        if (huvi == 0) return; // Avoid division by zero

        at[idx]++;
        for (int j = 0; j < m; j++) {
            if (b[j] <= 0) continue;
            b[j] -= a1[idx];
            a[idx] -= b1[j];
            rec(!alice, n, m, p / huvi, a, b, at, bt);
            b[j] += a1[idx];
            a[idx] += b1[j];
        }
        at[idx]--;
    } else {
        int idx = -1, mn = INT_MAX;
        for (int i = m - 1; i >= 0; i--) {
            if (b[i] > 0 && bt[i] <= mn) {
                mn = bt[i];
                idx = i;
            }
        }

        double huvi = 0;
        for (int j = 0; j < n; j++) {
            if (a[j] > 0) huvi += 1.0;
        }
//        if (huvi == 0) return; // Avoid division by zero

        bt[idx]++;
        for (int j = 0; j < n; j++) {
            if (a[j] <= 0) continue;
            a[j] -= b1[idx];
            b[idx] -= a1[j];
            rec(!alice, n, m, p / huvi, a, b, at, bt);
            a[j] += b1[idx];
            b[idx] += a1[j];
        }
        bt[idx]--;
    }
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    vector<int> a(10), b(10);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a1[i] = a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
        b1[i] = b[i];
    }

    vector<int> at(10), bt(10);
    cout << fixed << setprecision(18);
    if (n != m) {
        if (n > m) {
            rec(1, n, m, 1.0, a, b, at, bt);
        } else {
            rec(0, n, m, 1.0, a, b, at, bt);
        }
    } else {
        rec(0, n, m, 0.5, a, b, at, bt);
        rec(1, n, m, 0.5, a, b, at, bt);
    }

    cout << aa << endl << bb << endl << tt << endl;
    return 0;
}