#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
ll n,m;
ld ans1,ans2,ans3;
struct Node{
	ll a,b,c;
};
vector<Node>a,b;
void dfs(ll cur,vector<Node>a,vector<Node>b,ld coef){
	if(!a.size()||!b.size()){
		if(!a.size()&&!b.size())ans3+=coef;
		else if(!a.size())ans2+=coef;
		else ans1+=coef;
		return ;
	}
	if(cur==0){
		ll mnt=1e9,pos=0;
		rep(i,0,(ll)a.size()-1){
			if(a[i].c<mnt)mnt=a[i].c,pos=i;
		}
		ld co=1.0/b.size();
		rep(i,0,(ll)b.size()-1){
			ll na1=a[pos].a-b[i].b;
			ll nb1=b[i].a-a[pos].b;
			vector<Node>nwa=a,nwb=b;
			if(na1<=0)nwa.erase(nwa.begin()+pos);
			else nwa[pos].a=na1,nwa[pos].c++;
			if(nb1<=0)nwb.erase(nwb.begin()+i);
			else nwb[i].a=nb1;
			dfs(cur^1,nwa,nwb,coef*co);
		}
	}
	else {
		ll mnt=1e9,pos=0;
		rep(i,0,(ll)b.size()-1){
			if(b[i].c<mnt)mnt=b[i].c,pos=i;
		}
		ld co=1.0/a.size();
		rep(i,0,(ll)a.size()-1){
			ll na1=a[i].a-b[pos].b;
			ll nb1=b[pos].a-a[i].b;
			vector<Node>nwa=a,nwb=b;
			if(na1<=0)nwa.erase(nwa.begin()+i);
			else nwa[i].a=na1;
			if(nb1<=0)nwb.erase(nwb.begin()+pos);
			else nwb[pos].a=nb1,nwb[pos].c++;
			dfs(cur^1,nwa,nwb,coef*co);
		}
	}
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read(),m=read();
	rep(i,1,n){
		ll x=read();
		a.push_back((Node){x,x,0});
	}
	rep(i,1,m){
		ll x=read();
		b.push_back((Node){x,x,0});
	}
	if(n==m){
		dfs(0,a,b,0.5);
		dfs(1,a,b,0.5);
	}
	else {
		if(n>m)dfs(0,a,b,1);
		else dfs(1,a,b,1);
	}
	cout<<fixed<<setprecision(12)<<ans1<<"\n"<<ans2<<"\n"<<ans3<<"\n";
	return 0;
}