#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
const int sz = 2e5 + 5, mod = 1e9 + 7;
int n, m;
int arr[sz], brr[sz], crr[sz], drr[sz];
bool chk(vector<int>&v) {
	for(int &u:v) if(u > 0) return false;
	return true;
}
int find_id1(vector<int>&v) {
	int id = -1;
	for(int i = 0; i < n; i++) {
		if(v[i] > 0) {
			if(id == -1 || crr[i] < crr[id])
				id = i; 
		}
	}
	return id;
}
int find_id2(vector<int>&v) {
	int id = -1;
	for(int i = 0; i < m; i++) {
		if(v[i] > 0) {
			if(id == -1 || drr[i] < drr[id])
				id = i; 
		}
	}
	return id;
}
double f1(vector<int>v1, vector<int>v2, int mov, int jit) {
	// for(int &u:v1) cout << u << " "; cout << "\n"; 
	// for(int &u:v2) cout << u << " "; cout << "\n";
	// cout << mov << " " << jit << "\n\n";
	int mx = 0;
	int a = chk(v1);
	int b = chk(v2);
	if(a|b) {
		if(jit == 0) {
			if(!a) {
				//cout << "fghgfhgf\n";
				return 1.0; 
			}
			return 0.0;
		}
		if(!b) return 1.0;
		return 0.0;
	}
	//cout << "hi\n";
	if(mov == 0) {
		int id = find_id1(v1);
		int koto = 0;
		for(int &u:v2) koto += (u > 0);
		double ans = 0.0;
		double a1 = 1.0 / koto;
		for(int i = 0; i < m; i++) {
			if(v2[i] > 0) {
				v1[id] -= brr[i];
				v2[i] -= arr[id];
				crr[id]++;
				ans += a1 * f1(v1, v2, 1, jit);
				v1[id] += brr[i];
				v2[i] += arr[id];
				crr[id]--;
			}
		}
		return ans;
	}
	int id = find_id2(v2);
	int koto = 0;
	for(int &u:v1) koto += (u > 0);
	double ans = 0.0;
	double a1 = 1.0 / koto;
	for(int i = 0; i < n; i++) {
		if(v1[i] > 0) {
			v2[id] -= arr[i];
			v1[i] -= brr[id];
			drr[id]++;
			ans += a1 * f1(v1, v2, 0, jit);
			v2[id] += arr[i];
			v1[i] += brr[id];
			drr[id]--;
		}
	}
	return ans;
}
int32_t main() {
	ios_base::sync_with_stdio(0);
  	cin.tie(0);
	cin >> n >> m;
	std::vector<int> v1(n), v2(m);
	for(int i = 0; i < n; i++) {
		cin >> arr[i];
		v1[i] = arr[i];
	}
	for(int i = 0; i < m; i++) {
		cin >> brr[i];
		v2[i] = brr[i];
	}
	double a = 0.0;
	double b = 0.0;
	if(n > m) {
		a = f1(v1, v2, 0, 0);
		b = f1(v1, v2, 0, 1);
	}
	if(n == m) {
		a = f1(v1, v2, 0, 0) + f1(v1, v2, 1, 0);
		b = f1(v1, v2, 0, 1) + f1(v1, v2, 1, 1);
		a /= 2;
		b /= 2;
	}
	if(n < m) {
		a = f1(v1, v2, 1, 0);
		b = f1(v1, v2, 1, 1);
	}
	cout << fixed << setprecision(10);
	cout << a << "\n";
	cout << b << "\n";
	cout << 1.0 - a - b << "\n";
	return 0;
}