#include<iostream>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<queue>
#include<set> 
#include<stack>
#include<bitset>
#include<unordered_map>
#include<iomanip>
#include<cassert>
#define fi first
#define se second
#define endl '\n'
#define pb push_back
#define ep emplace_back 
#define debug(x) cout<<x<<'\n'
#define RES cout<<res<<'\n'
#define ANS cout<<ans<<'\n'
#define YES	cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define Yes	cout<<"Yes"<<'\n'
#define No cout<<"No"<<'\n'
#define me(a,x) memset(a,x,sizeof(a))
#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)
#define r23 cout<<233<<endl;return;
#define int long long 
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<PII,int> PIII;
typedef unsigned long long ull;
const int N=10,P=131,mod=998244353;

int n,m;
int a[N],b[N],at[N],bt[N];
int atk[N],btk[N];
double res,res1,res2;
int check(){
	int f1=1,f2=1;
	L(i,1,n){
		if(a[i]>0){
			f1=0;
			break;
		}
	} 
	L(i,1,m){
		if(b[i]>0){
			f2=0;
			break;
		}
	}
	if(f1&&f2)return 2;//结束 
	if(f2)return 0;//awin 
	if(f1)return 1;//bwin
	return 3;//未结束 
}
int cal(int n,int arr[8]){
	int res=0;
	L(i,1,n){
		if(arr[i]<=0)continue;
		++res;
	}
	return res;
}
void dfs(int a[],int b[],int opt,double p){
	int t=check();
	if(t!=3){
		if(t==2)res+=p;
		if(t==0)res1+=p;
		if(t==1)res2+=p;
		return;
	}
	int si=cal((opt==0?m:n),(opt==0?b:a));
	double p2=p/(1.0*si);
	if(opt==0){
		int pos,micnt=1e9+5;
		L(i,1,n){
			if(a[i]<=0)continue;
			if(atk[i]<micnt){
				micnt=atk[i];
				pos=i;
			}
		}
		L(i,1,m){
			if(b[i]<=0)continue;
			b[i]-=at[pos];
			a[pos]-=bt[i];
			atk[pos]++;
			dfs(a,b,opt^1,p2);
			b[i]+=at[pos];
			a[pos]+=bt[i];
			atk[pos]--;
		}
	}else{
		int pos,micnt=1e9+5;
		L(i,1,m){
			if(b[i]<=0)continue;
			if(btk[i]<micnt){
				micnt=btk[i];
				pos=i;
			}
		}
		L(i,1,n){
			if(a[i]<=0)continue;
			a[i]-=bt[pos];
			b[pos]-=at[i];
			btk[pos]++;
			dfs(a,b,opt^1,p2);
			a[i]+=bt[pos];
			b[pos]+=at[i];
			btk[pos]--;
		}
	}
}
void solve(){
	cin>>n>>m;
	L(i,1,n)cin>>a[i],at[i]=a[i];
	L(i,1,m)cin>>b[i],bt[i]=b[i];
	if(n>m){
		dfs(a,b,0,1);
	}
	else if(n<m){
		dfs(a,b,1,1);
	}else{
		dfs(a,b,0,0.5);
		dfs(a,b,1,0.5);
	} 
	cout<<fixed<<setprecision(15)<<res1<<endl<<res2<<endl<<res;
	
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}