#include <bits/stdc++.h>
using namespace std;
#define rep(i, d, u) for(int i = d; i <= u; ++i)
const int _maxn = 7, _zinf = 1000000001;
int n, m, a[_maxn], b[_maxn];
struct node {
	int le[_maxn], ri[_maxn];
	long long lt[_maxn], rt[_maxn];
	node atak(int la, int ra, bool st) {
		if(st) {
			rt[ra] += a[la];
		} else {
			lt[la] += b[ra];
		}
		node re = *this;
		if((re . le[la] -= b[ra]) < 0) {
			re . le[la] = 0;
		}
		if((re . ri[ra] -= a[la]) < 0) {
			re . ri[ra] = 0;
		}
		return re;
	}
	int chek() {
		int la = 0, ra = 0;
		rep(i, 0, n - 1) {
			if(le[i]) {
				la = 1;
				break;
			}
		}
		rep(i, 0, m - 1) {
			if(ri[i]) {
				ra = 1;
				break;
			}
		}
		return la << 1 | ra;
	}
} orig;
bool operator<(node le, node ri) {
	rep(i, 0, n - 1) {
		if(le . le[i] != ri . le[i]) {
			return le . le[i] < ri . le[i];
		}
	}
	rep(i, 0, m - 1) {
		if(le . ri[i] != ri . ri[i]) {
			return le . ri[i] < ri . ri[i];
		}
	}
	rep(i, 0, n - 1) {
		if(le . lt[i] != ri . lt[i]) {
			return le . lt[i] < ri . lt[i];
		}
	}
	rep(i, 0, m - 1) {
		if(le . rt[i] != ri . rt[i]) {
			return le . rt[i] < ri . rt[i];
		}
	}
	return 0;
}
struct dats {
	double le, ri, bl;
	dats() {}
	dats(double fi, double se, double th) : le(fi), ri(se), bl(th) {}
};
dats operator+(dats le, dats ri) {
	return dats(le . le + ri . le, le . ri + ri . ri, le . bl + ri . bl);
}
dats operator/(dats le, int ri) {
	return dats(le . le / ri, le . ri / ri, le . bl / ri);
}
map<node, dats> maps[2];
dats dfs1(bool at, node st) {
	switch(st . chek()) {
		case 0 : return dats(0, 0, 1);
		case 1 : return dats(0, 1, 0);
		case 2 : return dats(1, 0, 0);
	}
	if(maps[at] . count(st)) {
		return maps[at][st];
	}
	int mi = _zinf, po, cn = 0;
	dats re(0, 0, 0);
	if(at) {
		rep(i, 0, m - 1) {
			if(st . ri[i] && mi > st . rt[i]) {
				mi = st . rt[i], po = i;
			}
		}
		rep(i, 0, n - 1) {
			if(st . le[i]) {
				re = re + dfs1(0, st . atak(i, po, at)), ++cn;
			}
		}
	} else {
		rep(i, 0, n - 1) {
			if(st . le[i] && mi > st . lt[i]) {
				mi = st . lt[i], po = i;
			}
		}
		rep(i, 0, m - 1) {
			if(st . ri[i]) {
				re = re + dfs1(1, st . atak(po, i, at)), ++cn;
			}
		}
	}
	return maps[at][st] = re / cn;
}
int main() {
	cin >> n >> m;
	rep(i, 0, n - 1) {
		cin >> a[i], orig . le[i] = a[i];
	}
	rep(i, 0, m - 1) {
		cin >> b[i], orig . ri[i] = b[i];
	}
	dats rans;
	if(n > m) {
		rans = dfs1(0, orig);
	} else if(n < m) {
		rans = dfs1(1, orig);
	} else {
		rans = (dfs1(0, orig) + dfs1(1, orig)) / 2;
	}
	printf("%.15lf\n%.15lf\n%.15lf\n", rans . le, rans . ri, rans . bl);
	return 0;
}