#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 8, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

using namespace std;

int n, m;
int dmgA[N];
int dmgB[N];

pair<double, double> solve(vector<ii> &a, vector<ii>& b, bool isA){
    int cnta = 0, cntb = 0;
    int mna = inf, mnb = inf;
    for(int i = 0; i < n; i++){
        if(a[i].ff > 0){
            cnta++;
            mna = min(mna, a[i].ss);
        }
    }
    for(int i = 0; i < m; i++){
        if(b[i].ff > 0){
            cntb++;
            mnb = min(mnb, b[i].ss);
        }
    }
    if(cnta > 0 && cntb == 0)return {1, 0};
    else if(cntb > 0 && cnta == 0)return {0, 1};
    else if(cnta == 0 && cntb == 0)return {0, 0};

    double resa = 0;
    double resb = 0;
    if(isA){
        int idx = -1;
        for(int i = 0; i < n; i++){
            if(a[i].ff > 0 && a[i].ss == mna){
                idx = i;
                break;
            }
        }
        for(int i = 0; i < m; i++){
            if(b[i].ff > 0){
                a[idx].ff -= dmgB[i];
                b[i].ff -= dmgA[idx];
                a[idx].ss++;
                auto x = solve(a, b, false);
                resa += (1.0 / cntb) * x.ff;
                resb += (1.0 / cntb) * x.ss;
                a[idx].ff += dmgB[i];
                b[i].ff += dmgA[idx];
                a[idx].ss--;
            }
        }
    } else {
        int idx = -1;
        for(int i = 0; i < m; i++){
            if(b[i].ff > 0 && b[i].ss == mnb){
                idx = i;
                break;
            }
        }
        for(int i = 0; i < n; i++){
            if(a[i].ff > 0){
                b[idx].ff -= dmgA[i];
                a[i].ff -= dmgB[idx];
                b[idx].ss++;
                auto x = solve(a, b, true);
                resa += (1.0 / cnta) * x.ff;
                resb += (1.0 / cnta) * x.ss;
                b[idx].ff += dmgA[i];
                a[i].ff += dmgB[idx];
                b[idx].ss--;
            }
        }
    }
    return {resa, resb};
}
void solve(){
    cin >> n >> m;
    vector<ii> a(n), b(m);
    for(int i = 0; i < n; i++){
        cin >> a[i].ff;
        dmgA[i] = a[i].ff;
        a[i].ss = 0;
    }
    for(int i = 0; i < m; i++){
        cin >> b[i].ff;
        dmgB[i] = b[i].ff;
        b[i].ss = 0;
    }

    pair<double, double> res = {0.0, 0.0};
    if(n > m){
        res = solve(a, b, true);
    } else if(n == m){
        auto x = solve(a, b, true);
        auto y = solve(a, b, false);
        res.ff += 0.5 * x.ff;
        res.ff += 0.5 * y.ff;
        res.ss += 0.5 * x.ss;
        res.ss += 0.5 * y.ss;
    } else {
        res = solve(a, b, false);
    }

    cout << setprecision(15) << res.ff << '\n' << res.ss << '\n' << (1.0 - res.ff - res.ss) << '\n';
}


int main(){
    int t = 1;
    while(t--){
        solve();
    }
    return 0;
}