#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

typedef tuple<int, int, int> tiii;

long double cnt[3];

void dfs(vector<tiii> a, vector<tiii> b, long double pf, int id) {
    if (a.empty() && b.empty()) return cnt[2] += pf, void();
    if (a.empty()) return cnt[!id] += pf, void();
    if (b.empty()) return cnt[id] += pf, void();
    long double coef = 1. / (int)b.size();
    int p = 0;
    for (int i = 1; i < (int)a.size(); i++)
        if (get<2>(a[i]) < get<2>(a[p])) p = i;
    for (int i = 0; i < (int)b.size(); i++) {
        vector<tiii> na, nb;
        for (int j = 0; j < (int)a.size(); j++)
            if (j != p)
                na.push_back(a[j]);
            else if (get<1>(b[i]) < get<0>(a[j]))
                na.emplace_back(get<0>(a[j]) - get<1>(b[i]), get<1>(a[j]), get<2>(a[j]) + 1);
        for (int j = 0; j < (int)b.size(); j++)
            if (j != i)
                nb.push_back(b[j]);
            else if (get<1>(a[p]) < get<0>(b[j]))
                nb.emplace_back(get<0>(b[j]) - get<1>(a[p]), get<1>(b[j]), get<2>(b[j]));
        dfs(nb, na, coef * pf, !id);
    }
    return;
}

void solve(void) {
    vector<tiii> a, b;
    int n, m;
    cin >> n >> m;
    for (int i = 0, x; i < n; i++) cin >> x, a.emplace_back(x, x, 0);
    for (int i = 0, x; i < m; i++) cin >> x, b.emplace_back(x, x, 0);

    long double ansA = 0, ansB = 0;
    if (n >= m) {
        cnt[0] = cnt[1] = cnt[2] = 0;
        dfs(a, b, 1, 0);
        ansA += cnt[0];
        ansB += cnt[1];
    }
    if (n <= m) {
        cnt[0] = cnt[1] = cnt[2] = 0;
        dfs(b, a, 1, 1);
        ansA += cnt[0];
        ansB += cnt[1];
    }
    if (n == m) ansA /= 2, ansB /= 2;

    cout << setiosflags(ios::fixed) << setprecision(18);
    cout << ansA << endl << ansB << endl << 1 - ansA - ansB << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

    int _ = 1;
    while (_--) solve();

    return 0;
}