#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define sc(x) scanf("%d",&x)
#define _sc(x) scanf("%lld",&x)
#define pf(x) printf("%d",x);
#define _pf(x) printf("%lld",x);
#define FOR(i,a,b) for(int i = a;i<=b;++i)
#define _FOR(i,a,b) for(int i = a;i<b;++i)
#define pb push_back
#define lb lowber_bound
#define ub upper_bound
#define lson(x) ((x) * 2)
#define rson(x) ((x) * 2 + 1)


const ll mod = 1e9+7;
const ll maxn = 1e6+10;
const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

ll pow2(ll a,ll n){ ll res = 1ll;while(n){if(n&1) res = (res*a)%mod;a = (a*a)%mod;n >>= 1;}return res;}

ll gcd(ll a,ll b){ return b?gcd(b,a%b):a; }

int T;
ll n,m;

ll a[8],b[8];
ll Aatk[8] , Batk[8];
ll AtkCnt[8] , BtkCnt[8];
double WinA , WinB , draw;


int check(){
	int f1 = 1, f2 = 1;
	for (int i = 0; i < n; ++i)
	{
		if (a[i] > 0)
		{
			f1 = 0;
			break;
		}
	}
	for (int i = 0; i < m; ++i)
	{
		if (b[i] > 0)
		{
			f2 = 0;
			break;
		}
	}
	if(f1 && f2) return 2; // 打平局面
	if(f2) return 0;	//  A Win
	if(f1) return 1; // B Win
	return 3; // 还未完成的局面
}

int Calc(int n , ll arr[8]){
	int res = 0;
	for (int i = 0; i < n; ++i)
	{
		if(arr[i] <= 0) continue;
		++res;
	}
	return res;
}

void dfs(auto a,auto b,int opt , double prob){
	int t = check();
	if(t != 3){
		if(t == 2) draw += prob;
		if(t == 0) WinA += prob;
		if(t == 1) WinB += prob;
		return ;
	}
	int size = Calc((opt == 0 ? m : n) , (opt == 0 ? b : a));

	double prob2 = prob / (1.0 * size);

	if(opt == 0){
		int pos , miCnt = 1e9+5;
		for (int i = 0; i < n; ++i)
		{
			if(a[i] <= 0) continue;
			if(AtkCnt[i] < miCnt){
				miCnt = AtkCnt[i];
				pos = i;
			}
		}

		for(int i = 0;i<m;++i){
			if(b[i] <= 0) continue;
			b[i] -= Aatk[pos];
			a[pos] -= Batk[i];
			AtkCnt[pos]++;
			dfs(a,b,opt ^ 1,prob2);
			b[i] += Aatk[pos];
			a[pos] += Batk[i];
			AtkCnt[pos]--;			
		}
	}else{
		int pos , miCnt = 1e9+5;
		for (int i = 0; i < m; ++i)
		{
			if(b[i] <= 0) continue;
			if(BtkCnt[i] < miCnt){
				miCnt = BtkCnt[i];
				pos = i;
			}
		}

		for(int i = 0;i<n;++i){
			if(a[i] <= 0) continue;
			a[i] -= Batk[pos];
			b[pos] -= Aatk[i];
			BtkCnt[pos]++;
			dfs(a,b,opt ^ 1,prob2);
			a[i] += Batk[pos];
			b[pos] += Aatk[i];
			BtkCnt[pos]--;		
		}
	}
}

void solve(){
	cin >> n >>  m;
	for (int i = 0; i < n; ++i)
	{
		cin >> a[i]; Aatk[i] = a[i];
	}
	for (int i = 0; i < m; ++i)
	{
		cin >> b[i]; Batk[i] = b[i];
	}
	if(n > m){
		dfs(a,b,0,1);
	}else if(m > n){
		dfs(a,b,1,1);
	}else{
		dfs(a,b,0,0.5);
		dfs(a,b,1,0.5);
	}

	cout << fixed << setprecision(15) << WinA << "\n" << WinB << "\n" << draw << "\n";

}
int main(void){
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);

	T = 1;
	while(T--){
		solve();
	}
	
	return 0;
}