#include <bits/stdc++.h>

#define int long long
using namespace std;

int anum, bnum;
long double awin, bwin, Tie;

class peo {
public:
    int hp, atk;
    int time;
    int idx;
};

bool cmp(peo a, peo b) {
    if (a.time != b.time)return a.time < b.time;
    return a.idx < b.idx;
}

void dfs(vector<peo> alice, vector<peo> bob, long double p, bool which) {
//    cout << alice.size() << " " << bob.size() << " " << p << " " << which << endl;
//    for (auto to: alice) {
//        cout << "{" << to.hp << "," << to.atk << "} ";
//    }
//    cout << endl;
//    for (auto to: bob) {
//        cout << "{" << to.hp << "," << to.atk << "} ";
//    }
//    cout << endl;
    if (alice.size() == 0 && bob.size() == 0) {
        Tie += p;
        return;
    } else if (alice.size() == 0) {
        bwin += p;
        return;
    } else if (bob.size() == 0) {
        awin += p;
        return;
    }
    if (which == 0) {
        stable_sort(alice.begin(), alice.end(), cmp);
        int length = bob.size();
        for (int i = 0; i < length; i++) {
            vector<peo> atmp = alice, btmp = bob;
            atmp[0].time++;
            if (alice[0].atk < bob[i].hp) {
                btmp[i].hp -= alice[0].atk;
            } else {
                btmp.erase(btmp.begin() + i);
            }
            if (bob[i].atk < alice[0].hp) {
                atmp[0].hp -= bob[i].atk;
            } else {
                atmp.erase(atmp.begin());
            }
            dfs(atmp, btmp, p / length, 1);
        }
    } else {
        stable_sort(bob.begin(), bob.end(), cmp);
        int length = alice.size();
        for (int i = 0; i < length; i++) {
            vector<peo> atmp = alice, btmp = bob;
            btmp[0].time++;
            if (bob[0].atk < alice[i].hp) {
                atmp[i].hp -= bob[0].atk;
            } else {
                atmp.erase(atmp.begin() + i);
            }
            if (alice[i].atk < bob[0].hp) {
                btmp[0].hp -= alice[i].atk;
            } else {
                btmp.erase(btmp.begin());
            }
            dfs(atmp, btmp, p / length, 0);
        }
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
//    cout.tie(0);
    cin >> anum >> bnum;
    vector<peo> alice, bob;
    for (int i = 1; i <= anum; i++) {
        int atk;
        cin >> atk;
        alice.push_back({atk, atk, 0, i});
    }
    for (int i = 1; i <= bnum; i++) {
        int atk;
        cin >> atk;
        bob.push_back({atk, atk, 0, i});
    }
    if (anum > bnum) {
        dfs(alice, bob, 1, 0);
    } else if (anum < bnum) {
        dfs(alice, bob, 1, 1);
    } else {
        dfs(alice, bob, 0.5, 0);
        dfs(alice, bob, 0.5, 1);
    }
//    cout << awin << "\n" << bwin << "\n" << Tie << "\n";
//    cout << awin + bwin + Tie;
    printf("%.15Lf\n%.15Lf\n%.15Lf", awin, bwin, Tie);
    return 0;
}