#include<bits/stdc++.h>
#define irep(i,l,r) for(int (i) = (l); (i) <= (r); ++(i))
#define drep(i,r,l) for(int (i) = (r); (i) >= (l); --(i))
#define ceil(pp,qq) (((pp)>0)^((qq)>0)?-abs(pp)/abs(qq):(pp)%(qq)?(pp)/(qq)+1:(pp)/(qq))
#define floor(pp,qq) (((pp)>0)^((qq)>0)?-ceil(abs(pp),abs(qq)):(pp)/(qq))
#define ll long long
#define LL __int128
using namespace std;

inline ll read(){
	char ch = getchar();
	ll s = 0; bool w = 0;
	while(!isdigit(ch)){if(ch == '-')w = 1;ch = getchar();}
	while(isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return w ? - s : s;
}

inline char rc(){
	char ch = getchar();
	while(1){
		if(ch >= 'A' && ch <= 'Z')return ch;
		if(ch >= 'a' && ch <= 'z')return ch;
		ch = getchar();
	}
}

template<class T1, class T2>
T1 min(T1 AA, T2 BB){return AA > BB ? BB : AA;}
template<class T1, class T2>
T1 max(T1 AA, T2 BB){return AA < BB ? BB : AA;}

const int itinf = 1e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;

int main(){
	int n = read(), m = read();
	vector<vector<array<ll, 3>>>a(2);
	irep(i, 0, n - 1){
		int x = read();
		a[0].push_back({x, x, 0});
	}
	irep(i, 0, m - 1){
		int x = read();
		a[1].push_back({x, x, 0});
	}
	// hp attack attack times
	int ali[2] = {n, m};
	double awin = 0, bwin = 0, tie = 0;
	function<void(int, double)>dfs = [&](int tp, double PROB) -> void{
		int avpos = -1;
		for(int i = 0; i < a[tp].size(); ++ i){
			auto [hp, att, tim] = a[tp][i];
			if(hp <= 0)continue;
			if(avpos == -1 || tim < a[tp][avpos][2])avpos = i;
		}
		auto [Ahp, Aatt, Atim] = a[tp][avpos];
		int base = ali[tp ^ 1];
		for(int i = 0; i < a[tp ^ 1].size(); ++ i){

			auto [hp, att, tim] = a[tp ^ 1][i];
			if(hp <= 0)continue;
			a[tp][avpos] = {Ahp - att, Aatt, Atim + 1};
			a[tp ^ 1][i] = {hp - Aatt, att, tim};
			if(Ahp - att <= 0)ali[tp] --;
			if(hp - Aatt <= 0)ali[tp ^ 1] --;

			if(ali[0] == 0 || ali[1] == 0){
				if(ali[0] == 0 && ali[1] == 0)tie += PROB / base;
				else if(ali[0] == 0)bwin += PROB / base;
				else awin += PROB / base;

				a[tp][avpos] = {Ahp, Aatt, Atim};
				a[tp ^ 1][i] = {hp, att, tim};
				if(Ahp - att <= 0)ali[tp] ++;
				if(hp - Aatt <= 0)ali[tp ^ 1] ++;
				continue;
			}
		//	cerr << avpos << ' ' << i << " al "<< ali[0] << ' ' << ali[1]<< endl;
			dfs(tp ^ 1, PROB / base);
			
			a[tp][avpos] = {Ahp, Aatt, Atim};
			a[tp ^ 1][i] = {hp, att, tim};
			if(Ahp - att <= 0)ali[tp] ++;
			if(hp - Aatt <= 0)ali[tp ^ 1] ++;	
			
			
		}
		return;
	};
	if(n >= m)dfs(0, 1);
	if(n <= m)dfs(1, 1);
	if(n == m)awin *= 0.5, bwin *= 0.5, tie *= 0.5;
	printf("%0.12lf\n%0.12lf\n%0.12lf",awin, bwin, tie);
	return 0;
}