// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define st first
#define nd second
#define bit(s,x) (((s)>>(x))&1)
#define ctz(s) __builtin_popcount(s)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull; 
//typedef __int128 i128; 
typedef long double ld;
typedef pair<int,int> pii; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; typedef pair<int,ll> pil;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
inline void write(ll x){ if(x<0) putchar('-'),x=-x; if(x>9) write(x/10); putchar(x%10+'0'); }
// remember to change!!!
const int mod=998244353;
inline void plust(int &x,int y,int p=mod){x=x+y<p?x+y:x+y-p;}
inline void mul(int &x,int y,int p=mod){x=1ll*x*y%p;}
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)mul(res,x,m);mul(x,x,m);}
	return res;
}
const int N=10;
const int INF=0x3fffffff;
// clang-format on
int n[2];
int HP[2][N],ATK[2][N],t[2][N];
typedef pair<double,double> pdd;
pdd operator +(pdd A,pdd B){return P(A.st+B.st,A.nd+B.nd);}
pdd operator *(pdd A,double B){return P(A.st*B,A.nd*B);}
inline int check(){
	int f1=0,f2=0;
	for(int i=1;i<=n[0];++i)f1 |= HP[0][i]>0;
	for(int i=1;i<=n[1];++i)f2 |= HP[1][i]>0;
	return f1 | f2<<1;
}
inline pdd dfs(bool f){
	int ret=check();
	if(ret==0)return P(0,0);
	if(ret==1)return P(1,0);
	if(ret==2)return P(0,1);
	int mn=0;
	for(int i=1;i<=n[f];++i)if(HP[f][i] > 0 && (mn==0 ||t[f][i] < t[f][mn]))mn=i;
	pdd res = P(0,0);
	++t[f][mn];
	int cnt=0;
	for(int i=1;i<=n[f^1];++i)if(HP[f^1][i]>0){
		++cnt;
		HP[f^1][i] -= ATK[f][mn];
		HP[f][mn] -= ATK[f^1][i];
		res = res + dfs(f^1);
		HP[f^1][i] += ATK[f][mn];
		HP[f][mn] += ATK[f^1][i];
	}
	--t[f][mn];
	return res*(1.0/cnt);
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	n[0]=read(),n[1]=read();
	for(int i=1;i<=n[0];++i)HP[0][i]=ATK[0][i]=read();
	for(int i=1;i<=n[1];++i)HP[1][i]=ATK[1][i]=read();
	pdd ans;
	if(n[0] > n[1])ans = dfs(0);
	else if(n[0] < n[1])ans = dfs(1);
	else ans = (dfs(0) + dfs(1))*0.5;
	printf("%.10lf\n%.10lf\n%.10lf\n",ans.st,ans.nd,1-ans.st-ans.nd);
    return 0;
}