#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using db = long double;

int n, m;
vi atk0, atk1;
db A = 0, B = 0, T = 0;

void dfs(vi hp0, vi hp1, vi cnt0, vi cnt1, int t, db p, int dep) {

//    for (int i = 0; i < dep; i++) cout << "_";
//    cout << "A : ";
//    for (int i = 0; i < n; i++)
//        cout << hp0[i] << "(" << atk0[i] << ") ";
//    cout << " , B : ";
//
//    for (int i = 0; i < m; i++)
//        cout << hp1[i] << "(" << atk1[i] << ") ";
//    cout << " , p " << p;
//    if (t == 0) cout << " A\n";
//    else cout << " B\n";


    db alive0 = 0, alive1 = 0;
    for (auto i: hp0) alive0 += (i > 0);
    for (auto i: hp1) alive1 += (i > 0);


    if (alive0 == 0 or alive1 == 0) {
        if (alive0 == alive1) T += p;
        else if (alive0 == 0) B += p;
        else A += p;
        return;
    }


    if (t == 0) { // Alice
        int id = -1;
        for (int i = 0; i < n; i++) {
            if (hp0[i] <= 0) continue;
            if (id == -1 or cnt0[id] > cnt0[i]) id = i;
        }
        cnt0[id]++;

        for (int i = 0; i < m; i++) {
            if (hp1[i] <= 0) continue;
            hp0[id] -= atk1[i], hp1[i] -= atk0[id];//, cnt1[j]++;
            dfs(hp0, hp1, cnt0, cnt1, t ^ 1, p / alive1, dep + 1);
            hp0[id] += atk1[i], hp1[i] += atk0[id];//, cnt1[j]--;
        }
    } else {
        int id = -1;
        for (int i = 0; i < m; i++) {
            if (hp1[i] <= 0) continue;
            if (id == -1 or cnt1[id] > cnt1[i]) id = i;
        }
        cnt1[id]++;
        for (int i = 0; i < n; i++) {
            if (hp0[i] <= 0) continue;
            hp0[i] -= atk1[id], hp1[id] -= atk0[i];//, cnt0[i]++;
            dfs(hp0, hp1, cnt0, cnt1, t ^ 1, p / alive0, dep + 1);
            hp0[i] += atk1[id], hp1[id] += atk0[i];//, cnt0[i]++;
        }
    }
    return;
}


int32_t main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    cin >> n >> m;
    atk0 = vi(n), atk1 = vi(m);
    for (auto &i: atk0) cin >> i;
    for (auto &i: atk1) cin >> i;
    if (n > m) dfs(atk0, atk1, vi(n), vi(m), 0, 1.0, 0);
    else if (m > n) dfs(atk0, atk1, vi(n), vi(m), 1, 1.0, 0);
    else dfs(atk0, atk1, vi(n), vi(m), 0, 0.5, 0), dfs(atk0, atk1, vi(n), vi(m), 1, 0.5, 0);

    cout << fixed << setprecision(10) << A << "\n" << B << "\n" << T << "\n";
    return 0;
}