#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 3e5 + 7;
typedef pair<int, int> pii;
const int mod = 998244353;
int hp[2][8];
int t[2][8];
int c[2][8];
int n, m;
bool cmp(pii p1, pii p2)
{
    if (p1.first == p2.first)
        return p1.second < p2.second;
    return p1.first < p2.first;
}
double res[3];
void dfs(int f, double p)
{

    vector<pair<int, int>> temp;
    int dsize = 0;
    int rn;
    if (f)
        rn = m;
    else
        rn = n;
    for (int i = 1; i <= rn; i++)
    {
        if (hp[f][i] > 0)
            temp.push_back({c[f][i], i});
    }
    if (rn == n)
        rn = m;
    else
        rn = n;
    for (int i = 1; i <= rn; i++)
        if (hp[!f][i] > 0)
            dsize++;

    sort(temp.begin(), temp.end(), cmp);
    int mysz = temp.size();
    if (mysz > 0 && dsize == 0)
    {
        res[f] += p;
        return;
    }
    if (mysz == 0 && dsize > 0)
    {
        res[!f] += p;
        return;
    }
    if (mysz == 0 && dsize == 0)
    {
        res[2] += p;
        return;
    }
    int idx = temp[0].second;
    for (int i = 1; i <= rn; i++)
    {
        if (hp[!f][i] <= 0)
            continue;
        hp[!f][i] -= t[f][idx];
        hp[f][idx] -= t[!f][i];
        // c[!f][i]++;
        c[f][idx]++;
        dfs(!f, p / dsize * 1.0);
        hp[!f][i] += t[f][idx];
        hp[f][idx] += t[!f][i];
        // c[!f][i]--;
        c[f][idx]--;
    }
}

void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> hp[0][i], t[0][i] = hp[0][i];
    for (int i = 1; i <= m; i++)
        cin >> hp[1][i], t[1][i] = hp[1][i];
    if (n > m)
    {
        dfs(0, 1);
    }
    else if (m > n)
    {
        dfs(1, 1);
    }
    else
    {
        dfs(0, 0.5);
        dfs(1, 0.5);
    }
    for (int i = 0; i < 3; i++)
    {
        cout << fixed << setprecision(12) << res[i] << ' ';
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}