#include<bits/stdc++.h>
using namespace std;
int n, m;
double Alice, Bob, Tie;
pair<int, int> a[10], b[10];
void dfs(int lastn, int lastm, double p, int t, int i, int j){
	if (lastn == 0 && lastm == 0){
		Tie += p;
		return;
	}
	if (lastn == 0){
		Bob += p;
		return;
	}
	if (lastm == 0){
		Alice += p;
		return;
	}
	if (t == 1){
		while (a[i].second == 0)
			i = i % n + 1;
		for (int k = 1; k <= m; k++)
			if (b[k].second > 0){
				int tmp1 = a[i].second;
				int tmp2 = b[k].second;
				a[i].second = max(0, a[i].second - b[k].first);
				b[k].second = max(0, b[k].second - a[i].first);
				dfs(lastn - (a[i].second == 0 ? 1 : 0), lastm - (b[k].second == 0 ? 1 : 0), p / lastm, 1 - t, i % n + 1, j);
				a[i].second = tmp1;
				b[k].second = tmp2;
			}
	}
	else{
		while (b[j].second == 0)
			j = j % m + 1;
		for (int k = 1; k <= n; k++)
			if (a[k].second > 0){
				int tmp1 = b[j].second;
				int tmp2 = a[k].second;
				b[j].second = max(0, b[j].second - a[k].first);
				a[k].second = max(0, a[k].second - b[j].first);
				dfs(lastn - (a[k].second == 0 ? 1 : 0), lastm - (b[j].second == 0 ? 1 : 0), p / lastn, 1 - t, i, j % m + 1);
				b[j].second = tmp1;
				a[k].second = tmp2;				
			}
	}
}
int main(){
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++){
		scanf("%d", &a[i].first);
		a[i].second = a[i].first;
	}
	for (int i = 1; i <= m; i++){
		scanf("%d", &b[i].first);
		b[i].second = b[i].first;
	}
	if (n > m)
		dfs(n, m, 1.0, 1, 1, 1);
	else
	if (n < m)
		dfs(n, m, 1.0, 0, 1, 1);
	else{
		dfs(n, m, 0.5, 1, 1, 1);
		dfs(n, m, 0.5, 0, 1, 1);
	}
	printf("%.12lf\n%.12lf\n%.12lf\n", Alice, Bob, Tie);
	return 0;
}