#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ull unsigned long long
#define ms(x, y) memset(x, y, sizeof x);
#define debug(x) cout << #x << " = " << x << endl;
#define ios ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define fre                           \
    freopen("input.txt", "r", stdin); \
    freopen("output.txt", "w", stdout);
const int mod = 998244353;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 10;
const double esp = 1e-6;
const ull MOD1 = 1610612741;
const ull MOD2 = 805306457;
const ull BASE1 = 1331;
const ull BASE2 = 131;
#define pre(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
char *p1, *p2, buf[100000]; // 快读和同步流二者只能选一个
#define nc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++)
int read()
{
    int x = 0, f = 1;
    char ch = nc();
    while (ch < 48 || ch > 57)
    {
        if (ch == '-')
            f = -1;
        ch = nc();
    }
    while (ch >= 48 && ch <= 57)
        x = x * 10 + ch - 48, ch = nc();
    return x * f;
}
void write(int x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
    return;
}
int n, m;
vector<int> g[N];
int a[N], b[N];
int aa[N], bb[N];
double x, y, z;
void dfs(int al, int bo, int who1, int who2, int op,int now)
{
    if (who1 > n)
        who1 -= n;
    if (who2 > m)
        who2 -= m;
    // cout<<al<<" "<<b`o<<" "<<who1<<" "<<who2<<" "<<op<<endl;
    // for(int i=1;i<=n;i++){
    //     cout<<aa[i]<<" ";
    // }
    // cout<<endl;
    // for(int i=1;i<=m;i++)cout<<bb[i]<<" ";
    // cout<<endl<<endl;
    if (al == 0 && bo == 0)
    {
        z+=1.0/now;
        return;
    }
    else if (al == 0)
    {
        y+=1.0/now;
        return;
    }
    else if (bo == 0)
    {
        x+=1.0/now;
        return;
    }
    if (op == 1)
    {
        if (aa[who1] <= 0)
        {
            dfs(al, bo, who1 + 1, who2, op,now);
            return;
        }
        int sum=0;
        for(int i=1;i<=m;i++){
            if(bb[i]>0)sum++;
        }
        for (int i = 1; i <= m; i++)
        {
            if (bb[i] <= 0)
                continue;
            int bl1 = aa[who1], bl2 = bb[i];
            if (bb[i] <= a[who1])
            {
                bb[i] -= a[who1];
                if (aa[who1] <= b[i])
                {
                    aa[who1] -= b[i];
                    dfs(al - 1, bo - 1, who1 + 1, who2, op ^ 1,now*sum);
                    aa[who1] += b[i];
                }
                else
                {
                    aa[who1] -= b[i];
                    dfs(al, bo - 1, who1 + 1, who2, op ^ 1,now*sum);
                    aa[who1] += b[i];
                }
                bb[i] += a[who1];
            }
            else
            {
                bb[i] -= a[who1];
                if (aa[who1] <= b[i])
                {
                    aa[who1] -= b[i];
                    dfs(al - 1, bo, who1 + 1, who2, op ^ 1,now*sum);
                    aa[who1] += b[i];
                }
                else
                {
                    aa[who1] -= b[i];
                    dfs(al, bo, who1 + 1, who2, op ^ 1,now*sum);
                    aa[who1] += b[i];
                }
                bb[i] += a[who1];
            }
        }
    }
    else
    {
        if (bb[who2] <= 0)
        {
            dfs(al, bo, who1, who2 + 1, op,now);
            return;
        }
        int sum=0;
        for(int i=1;i<=n;i++){
            if(aa[i]>0)sum++;
        }
        for (int i = 1; i <= n; i++)
        {
            if (aa[i] <= 0)
                continue;
            int bl1 = aa[i], bl2 = bb[who2];
            if (aa[i] <= b[who2])
            {
                aa[i] -= b[who2];
                if (bb[who2] <= a[i])
                {
                    bb[who2] -= a[i];
                    dfs(al - 1, bo - 1, who1, who2 + 1, op ^ 1,now*sum);
                    bb[who2] += a[i];
                }
                else
                {
                    bb[who2] -= a[i];
                    dfs(al - 1, bo, who1, who2 + 1, op ^ 1,now*sum);
                    bb[who2] += a[i];
                }
                aa[i] += b[who2];
            }
            else
            {
                aa[i] -= b[who2];
                if (bb[who2] <= a[i])
                {
                    bb[who2] = -1;
                    dfs(al, bo - 1, who1, who2 + 1, op ^ 1,now*sum);
                    bb[who2] = bl2;
                }
                else
                {
                    bb[who2] -= a[i];
                    dfs(al, bo, who1, who2 + 1, op ^ 1,now*sum);
                    bb[who2] += a[i];
                }
                aa[i] += b[who2];
            }
        }
    }
    return;
}
void solve()
{
    cin >> n >> m;
    pre(i, 1, n)
    {
        cin >> a[i];
        aa[i] = a[i];
    }
    pre(i, 1, m)
    {
        cin >> b[i];
        bb[i] = b[i];
    }
    if (n > m)//a da b
    {
        dfs(n, m, 1, 1, 1,1);
    }
    else if (n < m)
    {
        dfs(n, m, 1, 1, 0,1);
    }
    else
    {
        dfs(n, m, 1, 1, 1,2);
        dfs(n, m, 1, 1, 0,2);
    }
    // int sum = x + y + z;
    // cout << x << " " << y << " " << z << endl;
    cout << fixed << setprecision(12) << x << " ";
    cout << fixed << setprecision(12) << y << " ";
    cout << fixed << setprecision(12) << z << endl;
}
// #define LOCAL
signed main()
{
    ios
    // fre
#ifdef LOCAL
        freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    auto start = std::chrono::high_resolution_clock::now();
#endif

    int t = 1;
    // cin >> t;
    while (t--)
        solve();

#ifdef LOCAL
    auto end = std::chrono::high_resolution_clock::now();
    cout << "Execution time: "
         << std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count()
         << " ms" << '\n';
#endif
    return 0;
}