#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define For(i,j,k) for (int i=(j);i<=(k);i++)
#define rof(i,j,k) for (int i=(j);i>=(k);i--)
#define ull unsigned long long
#define lowbit(x) ((x)&(-(x)))
#define PII pair<int,int>
#define int long long
#define endl "\n"
#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int mod = 998244353;
const double eps = 1e-9;
const int N=10;
int n,m;
int h1[N],a1[N],h2[N],a2[N];
int cnt1[N],cnt2[N];
double ans1,ans2,ans3;
void dfs(int u,double p){
    int flag1=0;
    int flag2=0;
    for(int i=1;i<=n;i++){
        if(a1[i]>0){
            flag1=1;
            break;
        }
    }
    for(int i=1;i<=m;i++){
        if(a2[i]>0){
            flag2=2;
            break;
        }
    }
    if(flag1&&!flag2){
        ans1+=p;
        return ;
    }else if(!flag1&&flag2){
        ans2+=p;
        return ;
    }else if(!flag1&&!flag2){
        ans3+=p;
        return ;
    }
    if(u==0){
        int idx=-1;
        int mi=0x3f3f3f3f;
        for(int i=1;i<=n;i++){
            if(a1[i]<=0) continue;
            if(mi>cnt1[i]){
                mi=cnt1[i];
                idx=i;
            }
        }
        cnt1[idx]++;
        double cnt=0;
        for(int i=1;i<=m;i++){
            if(a2[i]>0){
                cnt++;
            }
        }
        for(int i=1;i<=m;i++){
            if(a2[i]<=0) continue;
            double sum=1.0/cnt;
            a2[i]-=h1[idx];
            a1[idx]-=h2[i];
            dfs(u^1,p*sum);
            a2[i]+=h1[idx];
            a1[idx]+=h2[i];
        }
        cnt1[idx]--;
    }else{
        int idx=-1;
        int mi=0x3f3f3f3f;
        for(int i=1;i<=m;i++){
            if(a2[i]<=0) continue;
            if(mi>cnt2[i]){
                mi=cnt2[i];
                idx=i;
            }
        }
        cnt2[idx]++;
        double cnt=0;
        for(int i=1;i<=n;i++){
            if(a1[i]>0){
                cnt++;
            }
        }
        for(int i=1;i<=n;i++){
            if(a1[i]<=0) continue;
            double sum=1.0/cnt;
            a1[i]-=h2[idx];
            a2[idx]-=h1[i];
            dfs(u^1,p*sum);
            a1[i]+=h2[idx];
            a2[idx]+=h1[i];
        }
        cnt2[idx]--;
    }
}
void solve(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>h1[i];
        a1[i]=h1[i];
    }
    for(int i=1;i<=m;i++){
        cin>>h2[i];
        a2[i]=h2[i];
    }
    if(n==m){
        dfs(0,0.5);
        dfs(1,0.5);
    }else if(n>m){
        dfs(0,1.0);
    }else{
        dfs(1,1.0);
    }
    cout<<fixed<<setprecision(15)<<endl;
    cout<<ans1<<endl;
    cout<<ans2<<endl;
    cout<<ans3<<endl;
}
signed main(){
    fast;
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}