#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int>PII;
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
ld ans1,ans2,ans3;
int at[8],bt[8],hpa[8],hpb[8];
bool da[8],db[8];
int n,m;

void dfs(int suma,int sumb,int lasta,int lastb,ld p,bool type)
{
	if(suma==0&&sumb==0)//tie
	{
		ans3+=p;
		return;
	}
	else if(suma==0)//b win
	{
		ans2+=p;
		return;
	}
	else if(sumb==0)//a win
	{
		ans1+=p;
		return;
	}
	if(!type)//a attack
	{
		while(lasta+1<=n&&da[lasta+1]) lasta++;
		lasta=(lasta==n?0:lasta);
		while(lasta+1<=n&&da[lasta+1]) lasta++;
		int id=lasta+1;
		for(int j=1;j<=m;j++)
			if(!db[j])
			{
				if(hpa[id]<=bt[j]&&hpb[j]<=at[id])//一起4
				{
					da[id]=db[j]=1;
					dfs(suma-1,sumb-1,id,lastb,p/(ld)sumb,1);
					da[id]=db[j]=0;
				}
				else if(hpa[id]<=bt[j])//a4
				{
					da[id]=1,hpb[j]-=at[id];
					dfs(suma-1,sumb,id,lastb,p/(ld)sumb,1);
					da[id]=0,hpb[j]+=at[id];
				}
				else//b4
				{
					db[j]=1,hpa[id]-=bt[j];
					dfs(suma,sumb-1,id,lastb,p/(ld)sumb,1);
					db[j]=0,hpa[id]+=bt[j];
				}
			}
	}
	else
	{
		while(lastb+1<=m&&db[lastb+1]) lastb++;
		lastb=(lastb==m?0:lastb);
		while(lastb+1<=m&&db[lastb+1]) lastb++;
		int id=lastb+1;
		for(int j=1;j<=n;j++)
			if(!da[j])
			{
				if(hpb[id]<=at[j]&&hpa[j]<=bt[id])//一起4
				{
					db[id]=da[j]=1;
					dfs(suma-1,sumb-1,lasta,id,p/(ld)suma,0);
					db[id]=da[j]=0;
				}
				else if(hpb[id]<=at[j])//b4
				{
					db[id]=1,hpa[j]-=bt[id];
					dfs(suma,sumb-1,lasta,id,p/(ld)suma,0);
					db[id]=0,hpa[j]+=bt[id];
				}
				else//a4
				{
					da[j]=1,hpb[id]-=at[j];
					dfs(suma-1,sumb,lasta,id,p/(ld)suma,0);
					da[j]=0,hpb[id]+=at[j];
				}
			}
	}
}
void solve()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>at[i],hpa[i]=at[i];
	for(int j=1;j<=m;j++) cin>>bt[j],hpb[j]=bt[j];
	if(n==m) dfs(n,m,0,0,0.5,0),dfs(n,m,0,0,0.5,1);
	else if(n>m) dfs(n,m,0,0,1,0);
	else dfs(n,m,0,0,1,1);
	cout<<fixed<<setprecision(18);
	cout<<ans1<<endl<<ans2<<endl<<ans3<<endl;
} 
int main()
{
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	int t=1;
	//cin>>t;
	while(t--)
		solve(); 
	return 0;
}