#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

struct item{
    int atk, hp, cnt;
};
 
int n;
int m;
item a[mxN];
item b[mxN];
int win1 = 0;
int win2 = 0;
int draw = 0;
int tot = 0;
 
pair<double, double> dfs(bool curTurn) {
    int alive1 = 0;
    int alive2 = 0;
    for(int i = 1; i <= n; i++) if(a[i].hp > 0) alive1++;
    for(int i = 1; i <= m; i++) if(b[i].hp > 0) alive2++;

    if(alive1 == 0 || alive2 == 0) {
        if(alive1 == 0 && alive2 == 0) return make_pair(0.0, 0.0);
        else if(alive1 == 0) return make_pair(0.0, 1.0);
        else return make_pair(1.0, 0.0);
    }


    int best = inf;
    int pos = -1;
    int cnt = 0;
    pair<double, double> res = make_pair(0.0, 0.0);
    if(curTurn == 0) {
        for(int i = 1; i <= n; i++) {
            if(a[i].hp > 0 && minimize(best, a[i].cnt) == true) {
                pos = i;
            }
        }
        for(int j = 1; j <= m; j++) if(b[j].hp > 0) {
            b[j].hp -= a[pos].atk;
            a[pos].hp -= b[j].atk;
            a[pos].cnt++;

            pair<double, double> tmp = dfs(curTurn ^ 1);
            res.fi += tmp.fi;
            res.se += tmp.se;

            b[j].hp += a[pos].atk;
            a[pos].hp += b[j].atk;
            a[pos].cnt--;
            ++cnt;
        }
    }
    else {
        for(int i = 1; i <= m; i++) {
            if(b[i].hp > 0 && minimize(best, b[i].cnt) == true) {
                pos = i;
            }
        }
        for(int j = 1; j <= n; j++) if(a[j].hp > 0) {
            a[j].hp -= b[pos].atk;
            b[pos].hp -= a[j].atk;
            b[pos].cnt++;

            pair<double, double> tmp = dfs(curTurn ^ 1);
            res.fi += tmp.fi;
            res.se += tmp.se;

            a[j].hp += b[pos].atk;
            b[pos].hp += a[j].atk;
            b[pos].cnt--;
            ++cnt;
        }
    }
    res.fi = 1LL * res.fi * ((double) 1 / (double) cnt);
    res.se = 1LL * res.se * ((double) 1 / (double) cnt);
    return res;
}

void solve()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        int x; cin >> x;
        a[i] = {x, x, 0};
    }
    for(int i = 1; i <= m; i++) {
        int x; cin >> x;
        b[i] = {x, x, 0};
    }


    pair<double, double> res;
    if(n > m) res = dfs(0);
    if(n < m) res = dfs(1);
    if(n == m) {
        res = dfs(0);
        res.fi *= 0.5;
        res.se *= 0.5;
        pair<double, double> tmp = dfs(1);
        res.fi += tmp.fi * 0.5;
        res.se += tmp.se * 0.5;
    }

    cout << fixed << setprecision(9) << res.fi << endl;
    cout << fixed << setprecision(9) << res.se << endl;
    cout << fixed << setprecision(9) << 1.0 - res.fi - res.se << endl;
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}