#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#define endl '\n'
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rep2(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
template<typename T>
void bu(vector<T> tem) { for (auto x : tem) cout << x << ' '; cout << endl; }
void bu(int a) { cout << a << endl; }
void bu(int a, int b) { cout << a << ' ' << b << endl; }
void bu(int a, int b, int c) { cout << a << ' ' << b << ' ' << c << endl; }
void kuaidu() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int max(int a, int b) { if (a < b) return b; return a; }
inline int min(int a, int b) { if (a < b) return a; return b; }
using PII = pair<int, int>;
using i128 = __int128;

//--------------------------------------------------------------------------------
const int N = 1e5 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e16;
int n, m, T;

struct node {
    int val;
    int lf;
    int cnt = 0;
    int id;
    bool operator<(const node& q1)const {
        if (cnt == q1.cnt) return id < q1.id;
        return cnt < q1.cnt;
    }
};
multiset<node> A, B;
double pi = 0;
double pa = 0, pb = 0;
int cnt;
//--------------------------------------------------------------------------------
void dfs(int fl, multiset<node>A, multiset<node>B, double p) {
    if (A.empty() and B.empty()) {
        pi += p;
        // cout << "pi " << pi << endl;
        return;
    }
    if (A.empty()) {
        pb += p;
        // cout << "pb " << pb << endl;
        return;
    }
    if (B.empty()) {
        pa += p;
        // cout << "pa " << pa << endl;
        return;
    }
    // cout << endl;
    // cout << "A" << endl;
    // for (auto [a, b] : A) {
    //     cout << a << " " << b << endl;
    // }
    // cout << "B" << endl;
    // for (auto [a, b] : B) {
    //     cout << a << " " << b << endl;
    // }
    // cout << endl;
    if (fl) {

        double len = A.size();
        for (auto [val1, lf1, cnt1, id1] : A) {
            auto [val, lf, cnt, id] = *B.begin();
            multiset<node> C, D;
            for (auto x : A) C.insert(x);
            for (auto x : B) D.insert(x);

            C.erase(C.find({ val1,lf1,cnt1,id1 }));

            lf1 -= val;
            if (lf1 > 0) C.insert({ val1,lf1,cnt1,id1 });

            D.erase(D.begin());

            lf -= val1;
            if (lf > 0) D.insert({ val,lf,cnt + 1,id });


            dfs(1 - fl, C, D, p / len);
        }
        return;
    }
    else {

        double len = B.size();
        for (auto [val1, lf1, cnt1, id1] : B) {
            auto [val, lf, cnt, id] = *A.begin();

            multiset<node> C, D;
            for (auto x : A) C.insert(x);
            for (auto x : B) D.insert(x);

            D.erase(D.find({ val1,lf1,cnt1,id1 }));

            lf1 -= val;
            if (lf1 > 0) D.insert({ val1,lf1,cnt1,id1 });

            C.erase(C.begin());

            lf -= val1;
            if (lf > 0) C.insert({ val,lf,cnt + 1,id });

            dfs(1 - fl, C, D, p / len);
        }
        return;
    }

}

signed main() {
    kuaidu();
    T = 1;
    while (T--) {
        cin >> n >> m;
        rep(i, 1, n) {
            int a; cin >> a;
            A.insert({ a,a,0,i });
        }
        rep(i, 1, m) {
            int a; cin >> a;
            B.insert({ a,a,0,i });
        }
        if (A.size() != B.size()) {
            int fl = 1;
            if (A.size() > B.size()) fl = 0;

            dfs(fl, A, B, 1);
        }
        else {
            // double p1, p2, p3;
            dfs(1, A, B, 1);
            // p1 = pa, p2 = pb, p3 = pi;
            dfs(0, A, B, 1);
            // pa = (pa + p1) / 2;
            pa /= 2, pb /= 2, pi /= 2;
        }

        cout << fixed << setprecision(12) << pa << endl;
        cout << fixed << setprecision(12) << pb << endl;
        cout << fixed << setprecision(12) << pi << endl;


    }
    return 0;
}