#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a,i##i=b;i<=i##i;++i)
#define ROF(i,a,b) for(int i=a,i##i=b;i>=i##i;--i)
using namespace std;
typedef long long ll;
typedef long double ld;
const int N=1e5+7;
int n,m,x;
struct rat{
    double w=0,d=0,l=0;
    rat operator*(double k){return {w*k,d*k,l*k};}
    rat operator+(rat k){return {w+k.w,d+k.d,l+k.l};}
};
struct node{int hp,at;}a[8],b[8];
rat dfs(int o,int A,int B){
    int ha=0,hb=0;
    FOR(i,0,n-1)ha+=(a[i].hp>0);
    FOR(i,0,m-1)hb+=(b[i].hp>0);
    if(!ha&&!hb)return {0,1,0};
    if(!ha)return {0,0,1};
    if(!hb)return {1,0,0};
    while(a[A].hp<=0)A=(A+1)%n;
    while(b[B].hp<=0)B=(B+1)%m;
    rat sum;
    if(!o){
        FOR(i,0,m-1)if(b[i].hp>0){
            a[A].hp-=b[i].at;
            b[i].hp-=a[A].at;
            sum=sum+dfs(!o,(A+1)%n,B);
            a[A].hp+=b[i].at;
            b[i].hp+=a[A].at;
        }
        return sum*(1.0/hb);
    }
    FOR(i,0,n-1)if(a[i].hp>0){
        a[i].hp-=b[B].at;
        b[B].hp-=a[i].at;
        sum=sum+dfs(!o,A,(B+1)%m);
        a[i].hp+=b[B].at;
        b[B].hp+=a[i].at;
    }
    return sum*(1.0/ha);
}
signed main(){
    scanf("%d%d",&n,&m);
    FOR(i,0,n-1)scanf("%d",&x),a[i]={x,x};
    FOR(i,0,m-1)scanf("%d",&x),b[i]={x,x};
    rat res;
    if(n>=m)res=res+dfs(0,0,0);
    if(n<=m)res=res+dfs(1,0,0);
    if(n==m)res=res*0.5;
    printf("%.10lf\n%.10lf\n%.10lf",res.w,res.l,res.d);
    return 0;
}