#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], le[_maxn], ri[_maxn];
long long lt[_maxn], rt[_maxn];
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);
}
int chek() {
	int la = 0, ra = 0;
	rep(i, 0, n - 1) {
		if(le[i] > 0) {
			la = 1;
			break;
		}
	}
	rep(i, 0, m - 1) {
		if(ri[i] > 0) {
			ra = 1;
			break;
		}
	}
	return la << 1 | ra;
}
dats dfs1(bool at) {
	switch(chek()) {
		case 0 : return dats(0, 0, 1);
		case 1 : return dats(0, 1, 0);
		case 2 : return dats(1, 0, 0);
	}
	int mi = _zinf, po, cn = 0;
	dats re(0, 0, 0);
	if(at) {
		rep(i, 0, m - 1) {
			if(ri[i] > 0 && mi > rt[i]) {
				mi = rt[i], po = i;
			}
		}
		rep(i, 0, n - 1) {
			if(le[i] > 0) {
				le[i] -= b[po], ri[po] -= a[i], rt[po] += a[i];
				re = re + dfs1(0), ++cn;
				le[i] += b[po], ri[po] += a[i], rt[po] -= a[i];
			}
		}
	} else {
		rep(i, 0, n - 1) {
			if(le[i] > 0 && mi > lt[i]) {
				mi = lt[i], po = i;
			}
		}
		rep(i, 0, m - 1) {
			if(ri[i] > 0) {
				ri[i] -= a[po], le[po] -= b[i], lt[po] += b[i];
				re = re + dfs1(1), ++cn;
				ri[i] += a[po], le[po] += b[i], lt[po] -= b[i];
			}
		}
	}
	return re / cn;
}
int main() {
	cin >> n >> m;
	rep(i, 0, n - 1) {
		cin >> a[i], le[i] = a[i];
	}
	rep(i, 0, m - 1) {
		cin >> b[i], ri[i] = b[i];
	}
	dats rans;
	if(n > m) {
		rans = dfs1(0);
	} else if(n < m) {
		rans = dfs1(1);
	} else {
		rans = (dfs1(0) + dfs1(1)) / 2;
	}
	printf("%.15lf\n%.15lf\n%.15lf\n", rans . le, rans . ri, rans . bl);
	return 0;
}