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

using minion = pair<int, int>;

map<pair<vector<minion>, vector<minion>>, pair<double, double>> dp;

pair<double, double> go(vector<minion> &a, vector<minion> &b) {
	if (a.empty() && b.empty()) {
		return make_pair(0, 0);
	}
	if (a.empty()) {
		return make_pair(0, 1);
	}
	if (b.empty()) {
		return make_pair(1, 0);
	}
	auto state = make_pair(a, b);
	if (dp.count(state)) {
		return dp[state];
	}
	pair<double, double> &res = dp[state];
	int attackingMinion = 0;
	for (int i = 0; i < (int) b.size(); ++i) {
		vector<minion> bb = b;
		bb[i].second -= a[attackingMinion].first;
		if (bb[i].second <= 0) {
			bb.erase(bb.begin() + i);
		}
		vector<minion> aa = a;
		aa[attackingMinion].second -= b[i].first;
		if (aa[attackingMinion].second <= 0) {
			aa.erase(aa.begin() + attackingMinion);
		} else {
			rotate(aa.begin(), aa.begin() + 1, aa.end());
		}
		auto cur = go(bb, aa);
		res.first += cur.second / b.size();
		res.second += cur.first / b.size();
	}
	return res;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<minion> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i].first;
		a[i].second = a[i].first;
	}
	vector<minion> b(m);
	for (int i = 0; i < m; ++i) {
		cin >> b[i].first;
		b[i].second = b[i].first;
	}
	pair<double, double> result;
	if (n > m) {
		result = go(a, b);
	} else if (n < m) {
		result = go(b, a);
		swap(result.first, result.second);
	} else {
		result = go(a, b);
		auto tmp = go(b, a);                           
		result.first = (result.first + tmp.second) * 0.5;
		result.second = (result.second + tmp.first) * 0.5;
	}
	cout.precision(18);
	cout << fixed << showpoint;  
	cout << result.first << endl;
	cout << result.second << endl;
	cout << 1.0 - result.first - result.second << endl;
	return 0;
}