#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ldb=long double;
using ull=unsigned long long;
const long long inf=0x3f3f3f3f3f3f3f3f;
using i128=__int128;
const int mod=1000000007;
const long double eps=0.00000000001;

struct frac
{
    ll fz;
    ll fm;
    frac operator+(const frac&x)const
    {
        ll lcm=(fm*x.fm)/gcd(fm,x.fm);
        ll fz1=fz*(lcm)/fm;
        ll fz2=x.fz*(lcm)/x.fm;
        ll tfz=fz1+fz2;
        ll g=gcd(tfz,lcm);
        frac ans={tfz/g,lcm/g};
        return ans;
    }
    frac operator*(const frac&x)const
    {
        ll tfm=fm*x.fm;
        ll tfz=fz*x.fz;
        ll g=gcd(tfz,tfm);
        frac ans={tfz/g,tfm/g};
        return ans;
    }
};

struct mn
{
    ll atk;
    ll hp;
    ll num;
};


struct zt
{
    vector<mn>a;
    vector<mn>b;
};

struct node
{
    zt z;
    ll f;
    ldb p;
};


void solve()
{
    ll n,m;
    cin>>n>>m;
    zt z;
    for(ll i=1;i<=n;i++)
    {
        ll x;
        cin>>x;
        z.a.push_back({x,x,0});
    }
    for(ll i=1;i<=m;i++)
    {
        ll x;
        cin>>x;
        z.b.push_back({x,x,0});
    }
    queue<node>q;
    if(z.a.size()==z.b.size())
    {
        q.push({z,0,0.5});
        q.push({z,1,0.5});
    }
    else if(z.a.size()>z.b.size())
    {
        q.push({z,0,1});
    }
    else if(z.a.size()<z.b.size())
    {
        q.push({z,1,1});
    }

    ldb a=0;
    ldb b=0;
    ldb d=0;
    while(!q.empty())
    {
        node k=q.front();
        q.pop();
        if(k.f==0)
        {
            ll la=(ll)k.z.a.size();
            ll wz=0;
            ll num=k.z.a[0].num;
            for(ll i=0;i<=la-1;i++)
            {
                if(k.z.a[i].num<num)
                {
                    num=k.z.a[i].num;
                    wz=i;
                }
            }
            ll lb=(ll)k.z.b.size();
            for(ll i=0;i<=lb-1;i++)
            {
                node tk=k;
                tk.z.a[wz].hp-=tk.z.b[i].atk;
                tk.z.a[wz].num++;
                tk.z.b[i].hp-=tk.z.a[wz].atk;
                if(tk.z.a[wz].hp<=0)
                {
                    tk.z.a.erase(tk.z.a.begin()+wz);
                }
                if(tk.z.b[i].hp<=0)
                {
                    tk.z.b.erase(tk.z.b.begin()+i);
                }
                tk.p=tk.p*(1.0/ldb(lb));
                tk.f^=1;
                if(tk.z.a.empty()&&tk.z.b.empty())
                {
                    d=d+tk.p;
                }
                else if(!tk.z.a.empty()&&tk.z.b.empty())
                {
                    a=a+tk.p;
                }
                else if(tk.z.a.empty()&&!tk.z.b.empty())
                {
                    b=b+tk.p;
                }
                else
                {
                    q.push(tk);
                }
            }
        }
        else if(k.f==1)
        {
            ll lb=(ll)k.z.b.size();
            ll wz=0;
            ll num=k.z.b[0].num;
            for(ll i=0;i<=lb-1;i++)
            {
                if(k.z.b[i].num<num)
                {
                    num=k.z.b[i].num;
                    wz=i;
                }
            }

            ll la=(ll)k.z.a.size();
            for(ll i=0;i<=la-1;i++)
            {
                node tk=k;
                tk.z.a[i].hp-=tk.z.b[wz].atk;
                tk.z.b[wz].hp-=tk.z.a[i].atk;
                tk.z.b[wz].num++;
                if(tk.z.a[i].hp<=0)
                {
                    tk.z.a.erase(tk.z.a.begin()+i);
                }
                if(tk.z.b[wz].hp<=0)
                {
                    tk.z.b.erase(tk.z.b.begin()+wz);
                }
                tk.p=tk.p*(1.0/ldb(la));
                tk.f^=1;
                if(tk.z.a.empty()&&tk.z.b.empty())
                {
                    d=d+tk.p;
                }
                else if(!tk.z.a.empty()&&tk.z.b.empty())
                {
                    a=a+tk.p;
                }
                else if(tk.z.a.empty()&&!tk.z.b.empty())
                {
                    b=b+tk.p;
                }
                else
                {
                    q.push(tk);
                }
            }
        }
    }
    printf("%.20Lf\n",a);
    printf("%.20Lf\n",b);
    printf("%.20Lf\n",d);





}

int main()
{
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    ll _=1;
//    cin>>_;
    while(_--)
    {
        solve();
    }
    return 0;
}