#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define endl "\n"
#define int long long
#define pb push_back
#define fi first
#define se second
#define dec(a, b) fixed << setprecision(b) << double (a)
#define mem0(x) memset(x,0,sizeof(x))
using namespace std;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef unsigned long long ULL;
const int N = 1e6+5,mod=1e9+7,modd=998244353;
int ar[N],br[N],ha[N],hb[N],atz[N],btz[N];
int  k, s,n,m,sum1,len;
int cmp(int a, int b){	return a > b;}
int lowbit(int x){return x&(-x);}
int read() { int x=0,f=1; char c=getchar(); while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();return x*f;}
int gcd(int p, int b){return b?gcd(b,p%b):p;}
int lcd(int p, int b){return p*b/gcd(p,b);}
int qmi(int a, int k, int MOD) {int res=1;while(k){if(k&1){res=res*a%MOD;}a=a*a%MOD;k>>=1;}return res;}
int inv(int p, int MOD){return qmi(p,MOD-2,MOD);}
const double eps = 1e-8;
double aa,bb,pp;
void dfs(double occurprob,int t1,int t2,int xian)
{
	if(t1<=0&&t2<=0){pp+=occurprob;return;}
	else if(t1<=0){bb+=occurprob;return;}
	else if(t2<=0){aa+=occurprob;return;}
	if(xian==1)
	{
		int xx=0;
        atz[xx]=1e18;
		 for(int i=1;i<=n;i++)
		 {
           if(ha[i]>0&&atz[i]<atz[xx])xx=i;
		 }
		 atz[xx]++;
		  for(int i=1;i<=m;i++)
		{
          if(hb[i]<=0)continue;
		  int tt1=t1,tt2=t2;
		  ha[xx]-=br[i];
		  hb[i]-=ar[xx];
		  if(ha[xx]<=0)tt1--;
		  if(hb[i]<=0)tt2--;
		  dfs(occurprob*1.0*(1.0/t2),tt1,tt2,xian+1);//战斗这个随从的概率是b队剩t2人中选1的概率
		  if(ha[xx]<=0)tt1++;
		  if(hb[i]<=0)tt2++;
		  ha[xx]+=br[i];
		  hb[i]+=ar[xx];
		 
		}
		 atz[xx]--;
	}
	else{
		int xx=0;
        btz[xx]=1e18;
		 for(int i=1;i<=m;i++)
		 {
           if(hb[i]>0&&btz[i]<btz[xx])xx=i;
		 }
		 btz[xx]++;
		  for(int i=1;i<=n;i++)
		{
          if(ha[i]<=0)continue;
		int tt1=t1,tt2=t2;
		  hb[xx]-=ar[i];
		  ha[i]-=br[xx];
		  if(hb[xx]<=0)tt2--;
		  if(ha[i]<=0)tt1--;
		  dfs(occurprob*1.0*(1.0/t1),tt1,tt2,xian-1);
		  if(hb[xx]<=0)tt2++;
		  if(ha[i]<=0)tt1++;
		  hb[xx]+=ar[i];
		  ha[i]+=br[xx];
		 
		}
		 btz[xx]--;
	}
 
}
signed main()
{
	int t=1;
	ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0);

		int a, b,c,d, l, y, x, s, r,flag = 0,idx = 0,gg = 0,hh=0,res=0,sum=0, sum2 = 0;
		string str2,str,str3;
 
        cin>>n>>m;
		for(int i=1;i<=n;i++)cin>>ar[i],ha[i]=ar[i];
		for(int i=1;i<=m;i++)cin>>br[i],hb[i]=br[i];
        if(n>m)dfs(1,n,m,1);
		else if(n<m)dfs(1,n,m,2);
		else{
			dfs(1,n,m,1);
			aa*=0.5;
			bb*=0.5;
			pp*=0.5;
			double k1=aa;
			double k2=bb;
			double k3=pp;
			aa=0;
			bb=0;
			pp=0;
			dfs(1,n,m,2);
			aa=k1+aa*0.5;
			bb=k2+bb*0.5;
			pp=k3+pp*0.5;
	
		}
		cout<<dec(aa,15)<<endl;
		cout<<dec(bb,15)<<endl;
		cout<<dec(pp,15)<<endl;

return 0;
}