//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
using namespace std;
const int N = 7;
int atka[N], atkb[N];
int n, m, ca[N], cb[N];
void read()
{
    cin >> n >> m;
    for (int i = 0; i < n; ++ i)
    {
        cin >> atka[i];
    }
    for (int j = 0; j < m; ++ j)
    {
        cin >> atkb[j];
    }
}
int cnt(vector<int> &x)
{
    int ret = 0;
    for (int i : x)
    {
        ret += i > 0;
    }
    return ret;
}
int fd(vector<int> &x, int c[])
{
    int ret = -1;
    for (int i = 0; i < x.size(); ++ i)
    {
        if (x[i] > 0)
        {
            if (ret == -1 || c[i] < c[ret])
            {
                ret = i;
            }
        }
    }
    return ret;
}
long double f(vector<int> a, vector<int> b, int t, int turn)
{
    int ta = cnt(a), tb = cnt(b);
    if (min(ta, tb) == 0)
    {
        if (t == 0 && ta > 0)
        {
            return 1;
        }
        if (t == 1 && tb > 0)
        {
            return 1;
        }
        return 0;
    }
    if (turn == 0)
    {
        int choosei = fd(a, ca);
        long double ret = 0;
        for (int j = 0; j < m; ++ j)
        {
            if (b[j] > 0)
            {
                vector<int> fa = a, fb = b;
                fa[choosei] -= atkb[j];
                fb[j] -= atka[choosei];
                ++ca[choosei];
                ret += f(fa, fb, t, turn ^ 1);
                --ca[choosei];
            }
        }
        ret /= tb;
        return ret;
    }
    else
    {
        long double ret = 0;
        int choosej = fd(b, cb);
        for (int i = 0; i < n; ++ i)
        {
            if (a[i] > 0)
            {
                vector<int> fa = a, fb = b;
                fa[i] -= atkb[choosej];
                fb[choosej] -= atka[i];
                ++cb[choosej];
                ret += f(fa, fb, t, turn ^ 1);
                --cb[choosej];
            }
        }
        ret /= ta;
        return ret;
    }
    assert(false);
}
void solve()
{
    long double x, y, z;
    vector<int> a, b;
    for (int i = 0; i < n; ++ i)
    {
        a.push_back(atka[i]);
    }
    for (int j = 0; j < m; ++ j)
    {
        b.push_back(atkb[j]);
    }
    if (n > m)
    {
        x = f(a, b, 0, 0), y = f(a, b, 1, 0), z = 1 - x - y;
    }
    else if (m > n)
    {
        x = f(a, b, 0, 1), y = f(a, b, 1, 1), z = 1 - x - y;
    }
    else
    {
        x = f(a, b, 0, 0) + f(a, b, 0, 1);
        y = f(a, b, 1, 0) + f(a, b, 1, 1);
        x /= 2;
        y /= 2;
        z = 1 - x - y;
    }
    cout << fixed << setprecision(9);
    cout << x << '\n' << y << '\n' << z;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}