#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <array>
#include <iomanip>
#include <unordered_map>

#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long double ld;
typedef long long ll;

const int U = 7;
using ld = long double;
using pii = pair<int, int>;
using sta = array<pii, U>;
using ai = array<int, U>;
using pdd = pair<ld, ld>;

struct state {
	sta A, B;
	int aA, aB;
	bool f;
	int finish() const {
		if (A[0].y == 0)
			if (B[0].y == 0)
				return 0;
			else
				return f ? -1 : 1;
		else
			if (B[0].y == 0)
				return f ? 1 : -1;
			else
				return 2;
	}
	ll find_hash() const {
		const ll R = 2343654461, P = 33663379, C = 1000000001;
		ll ans = R;

		ans *= P;
		ans += f;

		for (int i = 0; i < U; ++i) {
			if (A[i].y <= 0) break;
			ans *= P;
			ans += A[i].x;
			ans *= P;
			ans += A[i].y;
		}

		ans *= P;
		ans += aA;

		ans *= P;
		ans += C;

		for (int i = 0; i < U; ++i) {
			if (B[i].y <= 0) break;
			ans *= P;
			ans += B[i].x;
			ans *= P;
			ans += B[i].y;
		}

		ans *= P;
		ans += aB;

		return ans;
	}
	void kill_minion(int m, bool who) {
		if (who) {
			A[m].y = 0;
			for (int i = m; i < U - 1; ++i)
				swap(A[i], A[i + 1]);
			if (aA > m)
				--aA;
			if (A[aA].y <= 0)
				aA = 0;
		} else {
			B[m].y = 0;
			for (int i = m; i < U - 1; ++i)
				swap(B[i], B[i + 1]);
			if (aB > m)
				--aB;
			if (B[aB].y <= 0)
				aB = 0;
		}
	}
	void maybe_kill_minion(int i, bool who) {
		int health = who ? A[i].y : B[i].y;
		if (health <= 0)
			kill_minion(i, who);
	}
	void fix_both() {
		if (aA >= U || A[aA].y <= 0)
			aA = 0;
		if (aB >= U || B[aB].y <= 0)
			aB = 0;
	}
	void mv(int fb) {
		A[aA].y -= B[fb].x;
		B[fb].y -= A[aA].x;
		int aaa = aA++;
		maybe_kill_minion(aaa, true);
		maybe_kill_minion(fb, false);

		fix_both();

		swap(A, B);
		swap(aA, aB);
		f = !f;
	}
};

pdd find_ans(const state& s) {
	{
		int f = s.finish();
		if (f != 2) return { f == 1, f == -1 };
	}
	static unordered_map<ll, pdd> stored;
	{
		auto it = stored.find(s.find_hash());
		if (it != stored.end()) return it->y;
	}
	int options = 0;
	pdd sum{ 0, 0 };
	for (int i = 0; i < U; ++i) {
		if (s.B[i].y <= 0) break;
		state ss = s;
		ss.mv(i);
		pdd curans = find_ans(ss);
		sum.x += curans.x;
		sum.y += curans.y;
		++options;
	}
	return { sum.x / options, sum.y / options };
}

void solve_test() {
	int n, m;
	cin >> n >> m;
	state s;
	s.aA = 0;
	for (int i = 0; i < n; ++i) {
		cin >> s.A[i].x;
		s.A[i].y = s.A[i].x;
	}
	for (int i = n; i < U; ++i)
		s.A[i].y = s.A[i].x = 0;
	s.aB = 0;
	for (int i = 0; i < m; ++i) {
		cin >> s.B[i].x;
		s.B[i].y = s.B[i].x;
	}
	for (int i = m; i < U; ++i)
		s.B[i].y = s.B[i].x = 0;
	s.f = true;
	state ss = s;
	swap(ss.A, ss.B);
	ss.f = false;
	pdd ans;
	if (n > m)
		ans = find_ans(s);
	else if (n < m)
		ans = find_ans(ss);
	else {
		pdd ans1 = find_ans(s);
		pdd ans2 = find_ans(ss);
		ans = { (ans1.x + ans2.x) / 2, (ans1.y + ans2.y) / 2 };
	}
	cout << ans.x << '\n' << ans.y << '\n' << 1 - ans.x - ans.y << '\n';
}

int main()
{
#ifdef ONPC
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	ios_base::sync_with_stdio(0); cin.tie(0);
	cout << setprecision(22) << fixed;
	solve_test();
	return 0;
}