#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define endl "\n"
#define PII pair<int,int>
const ll INF=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+9;
const int N=3e5+5;
double p1,p2,p3;
int A[10],B[10];
int Ha[10],Hb[10];
int c1[10],c2[10];
void dfs(int s,vector<int>a,vector<int>b,double p){
	if(!a.size()&&!b.size()) p3+=p; 
	else if(!a.size()) p2+=p;
	else if(!b.size()) p1+=p;
	else{
		if(s&1){
			double pp=p/b.size();
			int ta=-1,id=-1;
			for(int i=0;i<a.size();i++){
				if(ta==-1||c1[ta]>c1[a[i]]) ta=a[i],id=i;
			}
			c1[ta]++;
			for(int i=0;i<b.size();i++){
				vector<int>aa=a,bb=b;
				int tb=b[i];
				Ha[ta]-=B[tb];
				Hb[tb]-=A[ta];
				if(Ha[ta]<=0) aa.erase(aa.begin()+id);
				if(Hb[tb]<=0) bb.erase(bb.begin()+i);
				dfs(s+1,aa,bb,pp);
				Ha[ta]+=B[tb];
				Hb[tb]+=A[ta];
			}
			c1[ta]--;
		}else{
			double pp=p/a.size();
			int tb=-1,id=-1;
			for(int i=0;i<b.size();i++){
				if(tb==-1||c2[tb]>c2[b[i]]) tb=b[i],id=i;
			}
			c2[tb]++;
			for(int i=0;i<a.size();i++){
				vector<int>aa=a,bb=b;
				int ta=a[i];
				Ha[ta]-=B[tb];
				Hb[tb]-=A[ta];
				if(Ha[ta]<=0) aa.erase(aa.begin()+i);
				if(Hb[tb]<=0) bb.erase(bb.begin()+id);
				dfs(s+1,aa,bb,pp);
				Ha[ta]+=B[tb];
				Hb[tb]+=A[ta];
			}
			c2[tb]--;
		}
	}
}
void solve(){
	int n,m; cin>>n>>m;
	vector<int>a(n),b(m);
	for(int i=0;i<n;i++) cin>>A[i],Ha[i]=A[i],a[i]=i;
	for(int i=0;i<m;i++) cin>>B[i],Hb[i]=B[i],b[i]=i;
	cout<<fixed<<setprecision(10);
	if(n!=m){
		dfs(n>m,a,b,1);
		cout<<p1<<' '<<p2<<' '<<p3<<endl;
	}else{
		dfs(0,a,b,1);
		memset(c1,0,sizeof c1);
		memset(c2,0,sizeof c2);
		dfs(1,a,b,1);
		cout<<p1/2<<' '<<p2/2<<' '<<p3/2<<endl;
	}
}
int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1; //cin>>T;
    while(T--) solve();
}