#include<bits/stdc++.h>
using namespace std;

using ld = long double;

struct ying{
    int hp,atk,ct;
};

struct jie{
    ld a,b,t;


    jie ni(){
        return {b,a,t};
    }

    jie operator + (jie li){
        return {a+li.a,b+li.b,t+li.t};
    }
};


jie dfs(vector<ying> a,vector<ying> b){
    if(a.empty()&&b.empty()){
        return {0,0,1};
    }
    if(b.empty()){
        return {1,0,0};
    }
    if(a.empty()){
        return {0,1,0};
    }

    int id = 0;
    int ci = 0x3f3f3f3f;
    for(int i = 0 ; i < a.size();++i){
        if(a[i].ct<ci){
            ci = a[i].ct;
            id = i;
        }
    }

    jie res={0,0,0};

    for(int i = 0; i< b.size();++i){
        ying u = a[id];
        ying v = b[i];
        u.hp -= v.atk;
        v.hp -= u.atk;
        u.ct++;
        vector<ying> na,nb;
        for(int j = 0;j<a.size();++j){
            if(j!=id){
                na.push_back(a[j]);
            }else if(u.hp>0){
                na.push_back(u);
            }
        }

        for(int j = 0 ; j<b.size();++j){
            if(j!=i){
                nb.push_back(b[j]);
            }else if(v.hp>0){
                nb.push_back(v);
            }
        }

        res = res + dfs(nb,na).ni();
    }

    res.a/=b.size();
    res.b/=b.size();
    res.t/=b.size();

    return res;
}


int main(){
    int n,m;cin>>n>>m;
    vector<ying> a(n),b(m);
    for(int i = 0; i< n ;++i){
        cin>>a[i].hp;
        a[i].atk = a[i].hp;
        a[i].ct = 0;
    }
    for(int i = 0 ; i< m ;++i){
        cin>>b[i].hp;
        b[i].atk = b[i].hp;
        b[i].ct = 0;
    }

    jie ans;

    if(a.size()>b.size()){
        ans = dfs(a,b);
    }else if(a.size()<b.size()){
        ans = dfs(b,a).ni();
    }else {
        ans = dfs(a,b) + dfs(b,a).ni();
        ans.a/=2;
        ans.b/=2;
        ans.t/=2;
    }

    cout<<fixed<<setprecision(13)<<ans.a<<'\n'<<ans.b<<'\n'<<ans.t;
    // system("pause");

    return 0;

}