#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define se second
#define fi first
const int mod = 1e9 + 7;

//#define int long long
ll ksm(ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b /= 2;
	}
	return ans;
}
int n, m;
int a[10], b[10], ah[10], bh[10], acn[10], bcn[10];
ld wa = 0, wb = 0, dw = 0;

int check() {
	int cna = 0, cnb = 0;
	for (int i = 1 ; i <= n ; i++)
		if (ah[i] > 0)
			cna++;
	for (int i = 1 ; i <= m ; i++)
		if (bh[i] > 0)
			cnb++;

	if (!cna && !cnb)
		return 1;
	if (!cna)
		return 2;
	if (!cnb)
		return 3;

	return 4;

}

int find(int op) {
	int cnt = 0;
	if (op == 0) {
		for (int i = 1 ; i <= m ; i++)
			if (bh[i] > 0)
				cnt++;
	} else {
		for (int i = 1 ; i <= n ; i++)
			if (ah[i] > 0)
				cnt++;
	}
	return cnt;
}

int findid(int op) {
	int mi = 1e9, id = -1;
	if (!op) {
		for (int i = 1 ; i <= n ; i++)
			if (acn[i] < mi && ah[i] > 0) {
				mi = acn[i], id = i;
			}
	} else {
		for (int i = 1 ; i <= m ; i++)
			if (bcn[i] < mi && bh[i] > 0) {
				mi = bcn[i], id = i;
			}
	}
	return id;
}

void dfs(int cur, ld p) {
	int ok = check();
	if (ok != 4) {
		//cout << "CWAO" << ' ' << ok << '\n';
		if (ok == 3)
			wa += p;
		if (ok == 2)
			wb += p;
		if (ok == 1)
			dw += p;
		return;
	}
	//cout << cur << ' ' << p << '\n';
	int id = findid(cur);
	//cout << cur << ' ' << id << '\n';
	int cn = find(cur);
	ld cp = p / cn;

	if (!cur) {
		for (int i = 1 ; i <= m ; i++) {
			if (bh[i] > 0) {
				bh[i] -= a[id];
				ah[id] -= b[i];
				acn[id]++;
				dfs(cur ^ 1, cp);
				bh[i] += a[id];
				ah[id] += b[i];
				acn[id]--;
			}
		}
	} else {
		for (int i = 1 ; i <= n ; i++) {
			if (ah[i] > 0) {
				ah[i] -= b[id];
				bh[id] -= a[i];
				bcn[id]++;
				dfs(cur ^ 1, cp);
				ah[i] += b[id];
				bh[id] += a[i];
				bcn[id]--;
			}
		}
	}
}

void solve() {

	cin >> n >> m;
	for (int i = 1 ; i <= n ; i++) {
		cin >> a[i];
		ah[i] = a[i];
		acn[i] = 0;
	}
	for (int i = 1 ; i <= m ; i++) {
		cin >> b[i];
		bh[i] = b[i];
		bcn[i] = 0;
	}

	if (n > m) {
		dfs(0, 1.0);
	} else if (n < m) {
		dfs(1, 1.0);
	} else {
		dfs(0, 0.5);
		dfs(1, 0.5);
	}

	cout << fixed << setprecision(18) << wa << '\n' << wb << '\n' << dw << '\n';

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}