#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <iomanip>
using namespace std;
const int N = 10;
#define int long long
struct Node
{
    int hp,atk;
    Node(int x,int y):hp(x),atk(y){}
};
double ans1,ans2,ans3;
vector<Node> a,b;
int T,n,m,win1,win2,tot;

void dfs(int peo,int acount,int bcount,vector<Node> a,vector<Node> b,double prob,int aid,int bid)
{
    if(acount == 0 && bcount == 0)
    {
        ans3 += prob;
        return ;
    }
    if(acount == 0)
    {
        ans2 += prob;
        return ;
    }
    if(bcount == 0)
    {
        ans1 += prob;
        return ;
    }
    while(a[aid].hp <= 0)
    {
        aid = (aid + 1) % a.size();
    }
    while(b[bid].hp <= 0)
    {
        bid = (bid + 1) % b.size();
    }
    if(!peo)
    {
        for(int i = 0;i < b.size();i++)
        {
            if(b[i].hp > 0)
            {
                int tmp1 = a[aid].hp,tmp2 = b[i].hp,tb = bcount;
                a[aid].hp -= b[i].atk;
                b[i].hp -= a[aid].atk;
                if(a[aid].hp <= 0) acount--;
                if(b[i].hp <= 0) bcount--;
                dfs(!peo,acount,bcount,a,b,(1.0 / tb) * prob,(aid + 1) % a.size(),bid);
                if(a[aid].hp <= 0) acount++;
                if(b[i].hp <= 0) bcount++;
                a[aid].hp = tmp1,b[i].hp = tmp2;
            }
        }
    }
    else
    {
        for(int i = 0;i < a.size();i++)
        {
            if(a[i].hp > 0)
            {
                int tmp1 = b[bid].hp,tmp2 = a[i].hp,ta = acount;
                b[bid].hp -= a[i].atk;
                a[i].hp -= b[bid].atk;
                if(b[bid].hp <= 0) bcount--;
                if(a[i].hp <= 0) acount--;
                dfs(!peo,acount,bcount,a,b,1.0 / ta * prob,aid,(bid + 1) % b.size());
                if(b[bid].hp <= 0) bcount++;
                if(a[i].hp <= 0) acount++;
                b[bid].hp = tmp1,a[i].hp = tmp2;
            }
        }
    }
}

void solve()
{
    cin >> n >> m;
    for(int i = 0;i < n;i++)
    {
        int x;
        cin >> x;
        a.push_back({x,x});
    }
    for(int i = 0;i < m;i++)
    {
        int x;
        cin >> x;
        b.push_back({x,x});
    }
    if(n > m)
    {
        dfs(0,n,m,a,b,1.0,0,0);
    }
    else if(n < m)
    {
        dfs(1,n,m,a,b,1.0,0,0);
    }
    else
    {
        dfs(0,n,m,a,b,0.5,0,0);
        dfs(1,n,m,a,b,0.5,0,0);
    }
    // cout << win1 << ' ' << win2 << ' ' << tot << endl;
    // double x = (double)win1 / (tot * 1.0),y = (double)win2 / (tot * 1.0);
    // double z = 1.0 - x - y;
    // cout << setprecision(12) << x << ' ' << y << ' ' << z << endl;
    cout << setprecision(12) << ans1 << endl << ans2 << endl << ans3 << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    T = 1;
    while(T--)
    {
        solve();
    }
}