#include<bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define mp make_pair
typedef pair<int, int> pi;
typedef long double dbl;

int n, m;
int l[2], r[2], num[2];
vector<int> a, b;
vector<int> atk;
map<vector<int>, array<dbl, 3>> dp;

int inc(int i, int l, int r) {
    i++; if (i==r) return l; return i;
}

array<dbl, 3> calc(vector<int> v) {
    if (dp.find(v)!=dp.end()) return dp[v];
    int cnt[2] = {0,0};
    F0R(p, 2) FOR(i, l[p], r[p]) if (v[i]) cnt[p]++;
    array<dbl, 3> ans = {0,0,0};
    int p = v[2];
    int o = 1-p;
    int x = v[p];
    FOR(y, l[o], r[o]) if (v[y]) {
        array<dbl, 3> tmp;
        vector<int> nxt = v;
        nxt[x] = max(0, nxt[x]-atk[y]);
        nxt[y] = max(0, nxt[y]-atk[x]);
        int ncnt[2] = {cnt[0], cnt[1]};
        if (nxt[x]==0) ncnt[p]--;
        if (nxt[y]==0) ncnt[o]--;
        if (ncnt[0]==0 && ncnt[1]==0) tmp = {0,1,0};
        else if (ncnt[1]==0) tmp = {1,0,0};
        else if (ncnt[0]==0) tmp = {0,0,1};
        else {
            nxt[p] = inc(nxt[p], l[p], r[p]);
            F0R(i, 2) {
                while (nxt[nxt[i]]==0) {
                    nxt[i] = inc(nxt[i], l[i], r[i]);
                }
            }
            nxt[2] = o;
            tmp = calc(nxt);
        }
        F0R(i, 3) ans[i] += tmp[i] / cnt[o];
    }
    dp[v] = ans;
    // F0R(i, v.size()) cout << v[i] << ' ';
    // cout << '\n';
    // F0R(i, 3) cout << ans[i] << ' ';
    // cout << '\n';
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    l[0] = 3; r[0] = n+3; num[0] = n;
    l[1] = n+3; r[1] = n+m+3; num[1] = m;
    a.resize(n); b.resize(m);
    F0R(i, n) cin >> a[i];
    F0R(i, m) cin >> b[i];
    atk = a;
    atk.insert(atk.end(), b.begin(), b.end());
    atk.insert(atk.begin(), 3, 0);
    vector<int> v = atk;
    v[0] = l[0]; v[1] = l[1];
    array<dbl, 3> ans = {0,0,0};
    if (n==m) {
        F0R(i, 2) {
            v[2] = i;
            array<dbl, 3> tmp = calc(v);
            F0R(j, 3) ans[j] += tmp[j]/2;
        }
    } else {
        if (n>m) v[2] = 0;
        else v[2] = 1;
        ans = calc(v);
    }
    cout << fixed << setprecision(15);
    cout << ans[0] << '\n' << ans[2] << '\n' << ans[1] << '\n';
}