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

int n, m, hpA[10], hpB[10], atkA[10], atkB[10], cntA[10], cntB[10];
double ansA, ansB, ansP;

void alice(double p, int numA, int numB);

void bob(double p, int numA, int numB) {
	if (numA == 0 || numB == 0) {
		if (numA == 0 && numB == 0) ansP += p;
		else if (numA == 0) ansB += p;
		else ansA += p;
		return ;
	}
	
	int k = -1;
	for (int i = 1; i <= m; i++) {
		if (hpB[i] > 0) {
			if (k == -1 || cntB[k] > cntB[i]) k = i;
		}
	}
	if (k < 0) return ;
	
	for (int i = 1; i <= n; i++) {
		if (hpA[i] > 0) {
			hpA[i] -= atkB[k];
			hpB[k] -= atkA[i];
			cntB[k]++;
			alice (p / numA, numA - (hpA[i] <= 0), numB - (hpB[k] <= 0));
			hpA[i] += atkB[k];
			hpB[k] += atkA[i];
			cntB[k]--;
		}
	}
}

void alice(double p, int numA, int numB) {
	if (numA == 0 || numB == 0) {
		if (numA == 0 && numB == 0) ansP += p;
		else if (numA == 0) ansB += p;
		else ansA += p;
		return ;
	}
	
	int k = -1;
	for (int i = 1; i <= n; i++) {
		if (hpA[i] > 0) {
			if (k == -1 || cntA[k] > cntA[i]) k = i;
		}
	}
	if (k < 0) return ;
	
	for (int i = 1; i <= m; i++) {
		if (hpB[i] > 0) {
			hpA[k] -= atkB[i];
			hpB[i] -= atkA[k];
			cntA[k]++;
			bob (p / numB, numA - (hpA[k] <= 0), numB - (hpB[i] <= 0));
			hpA[k] += atkB[i];
			hpB[i] += atkA[k];
			cntA[k]--;
		}
	}
}

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> hpA[i];
		atkA[i] = hpA[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> hpB[i];
		atkB[i] = hpB[i];
	}
	
	if (n > m) alice(1, n, m);
	else if (n < m) bob(1, n, m);
	else {
		alice(0.5, n, m);
		bob(0.5, n, m);
	}
	
	cout << fixed << setprecision(10) << ansA << '\n' << ansB << '\n' << ansP;
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}