#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define ll long long
#define pb push_back
#define ld long double
#define tie TIE
int n,m;
int att[10],btt[10];
ld ansa = 0,ansb = 0,tie = 0;
struct node{
    int at,cnt,hp;
};
vector<node>A,B;
void dfs(const vector<node>&ta,const vector<node>&tb, int who,ld p ) {
    vector<node>a = ta,b = tb;
    int na = a.size(),nb = b.size(),l=-1,r=-1,cnt = 1000000000;
    rep(i,0,na-1) if( a[i].cnt < cnt )
        l = i , cnt = a[i].cnt;   cnt = 100000000;
    rep(i,0,nb-1) if( b[i].cnt < cnt )
        r = i , cnt = b[i].cnt;
    
    // printf("#%d %.5Lf %d %d\n",who,p,l,r);
    // for( auto x : hpa ) printf("%d ",x); printf("\n");
    // for( auto x : hpb ) printf("%d ",x); printf("\n");
    // for( auto x : cnta ) printf("%d ",x); printf("\n");
    // for( auto x : cntb ) printf("%d ",x); printf("\n\n");

    if( l == -1 && r == -1 ) { tie += p; return; }
    if( l == -1 ) { ansb += p; return; }
    if( r == -1 ) { ansa += p; return; }

    if( who == 1 ) {
        rep(i,0,nb-1) {
            a[l].hp = max( a[l].hp - b[i].at , 0 ); a[l].cnt++;
            b[i].hp = max( b[i].hp - a[l].at , 0 );
            if( a[l].hp == 0 ) a.erase( a.begin() + l );
            if( b[i].hp == 0 ) b.erase( b.begin() + i );
            dfs( a , b  , 2 , p * ( (ld)(1.0) / nb ) );
            a = ta; b = tb;
        }
    }
    else {
        rep(i,0,na-1) {
            a[i].hp = max( a[i].hp - b[r].at , 0 );
            b[r].hp = max( b[r].hp - a[i].at , 0 );
            b[r].cnt++;
            if( a[i].hp == 0 ) a.erase( a.begin() + i );
            if( b[r].hp == 0 ) b.erase( b.begin() + r );
            dfs( a , b , 1 , p * ( (ld)(1.0) / na ) );
            a = ta; b = tb;
        }
    }
}
int main() {
    scanf("%d%d",&n,&m);
    rep(i,0,n-1) scanf("%d",&att[i]) , A.pb( (node){att[i],0,att[i]} ) ;
    rep(i,0,m-1) scanf("%d",&btt[i]) , B.pb( (node){btt[i],0,btt[i]} ) ;
    if( n > m ) {
        dfs( A,B,1,1.0 );
    }
    else if( n < m ) {
        dfs( A,B,2,1.0 );
    }
    else {
        dfs( A,B,1,0.5 );
        dfs( A,B,2,0.5 );
    }
    printf("%.13Lf\n%.13Lf\n%.13Lf\n",ansa,ansb,tie);
    return 0; 
}