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

using LD = long double;

int n, m;
int atk[2][10];
LD Awin=0, Bwin=0, Tie=0;

void dfs(vector<int> hp1, vector<int> hp2, int ft, int cur, int nxt, LD p){
//	printf("dfs(ft=%d cur=%d nxt=%d p=%Lf)\n", ft, cur, nxt, p);
//	printf("hp1:"); for (int i=0; i<7; ++i) printf("%d ", hp1[i]); puts("");
//	printf("hp2:"); for (int i=0; i<7; ++i) printf("%d ", hp2[i]); puts("");
	bool ok=false;
	for (int i=0; i<7; ++i){
		if (hp1[(cur+i)%7]>0){ok=true; cur=(cur+i)%7; break;}
	}
	
	int alive=0;
	for (int i=0; i<7; ++i) if (hp2[i]>0) ++alive;
	
	if (!ok && 0==alive){
		Tie+=p; return;
	}else if (0==alive){
		if (0==ft) Awin+=p;
		else Bwin+=p;
		return;
	}else if (!ok){
		if (1==ft) Awin+=p;
		else Bwin+=p;
		return;
	}
	
	for (int i=0; i<7; ++i) if (hp2[i]>0){
		vector<int> nhp1=hp1, nhp2=hp2;
		nhp1[cur] = max(0, nhp1[cur]-atk[ft^1][i]);
		nhp2[i] = max(0, nhp2[i]-atk[ft][cur]); 
		dfs(nhp2, nhp1, ft^1, nxt, (cur+1)%7, p/alive);
	}
}

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	cout << setiosflags(ios::fixed) << setprecision(15);
	cin >> n >> m;
	for (int i=0; i<n; ++i) cin >> atk[0][i];
	for (int i=0; i<m; ++i) cin >> atk[1][i];
	vector<int> hp1(7), hp2(7);
	for (int i=0; i<7; ++i) hp1[i]=atk[0][i];
	for (int i=0; i<7; ++i) hp2[i]=atk[1][i];
	
	if (n==m){
		dfs(hp1, hp2, 0, 0, 0, 0.5L);
		dfs(hp2, hp1, 1, 0, 0, 0.5L);
	}else if (n>m) dfs(hp1, hp2, 0, 0, 0, 1.0L);
	else dfs(hp2, hp1, 1, 0, 0, 1.0L);
	
	cout << Awin << '\n' << Bwin << '\n' << Tie << '\n';
	return 0;	
}