#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


using Double = double;

int N[2];
Int A[2][7];

Int ASum[2][1 << 7];

map<vector<int>, pair<Double, Double>> cache[2][7][7];
pair<Double, Double> solve(int turn, int cur0, int cur1, const vector<int> &ps) {
#define id(h, i) ((h) ? (N[0] + (i)) : (i))
  int alive[2] = {};
  for (int h = 0; h < 2; ++h) for (int i = 0; i < N[h]; ++i) {
    if (~ps[id(h, i)]) {
      ++alive[h];
    }
  }
  if (!alive[0] && !alive[1]) return make_pair(0.0, 0.0);
  if (!alive[0]) return make_pair(0.0, 1.0);
  if (!alive[1]) return make_pair(1.0, 0.0);
  
  for (; !~ps[id(0, cur0)]; ) if (++cur0 == N[0]) cur0 = 0;
  for (; !~ps[id(1, cur1)]; ) if (++cur1 == N[1]) cur1 = 0;
  int nxt0 = cur0;
  int nxt1 = cur1;
  if (turn == 0) if (++nxt0 == N[0]) nxt0 = 0;
  if (turn == 1) if (++nxt1 == N[1]) nxt1 = 0;
  
  auto it = cache[turn][cur0][cur1].find(ps);
  if (it != cache[turn][cur0][cur1].end()) return it->second;
  Double ret[2] = {};
  
  const int i = turn ? cur1 : cur0;
  for (int j = 0; j < N[turn ^ 1]; ++j) if (~ps[id(turn ^ 1, j)]) {
    const Int ai = A[turn    ][i];
    const Int aj = A[turn ^ 1][j];
    const Int hi = ai - ASum[turn ^ 1][ps[id(turn, i)]];
    const Int hj = aj - ASum[turn    ][ps[id(turn ^ 1, j)]];
    auto qs = ps;
    if (hi > aj) {
      if (hj > ai) {
        assert(false);
      } else {
        qs[id(turn, i)] |= 1 << j;
        qs[id(turn ^ 1, j)] = -1;
      }
    } else {
      if (hj > ai) {
        qs[id(turn, i)] = -1;
        qs[id(turn ^ 1, j)] |= 1 << i;
      } else {
        qs[id(turn, i)] = -1;
        qs[id(turn ^ 1, j)] = -1;
      }
    }
    const auto res = solve(turn ^ 1, nxt0, nxt1, qs);
    ret[0] += res.first;
    ret[1] += res.second;
  }
  for (int h = 0; h < 2; ++h) {
    ret[h] /= alive[turn ^ 1];
  }
#undef id
  
// if(N[0]==2)cerr<<turn<<" "<<cur0<<" "<<cur1<<" "<<ps<<": "<<ret[0]<<" "<<ret[1]<<endl;
  return cache[turn][cur0][cur1][ps] = make_pair(ret[0], ret[1]);
}

int main() {
  for (; ~scanf("%d%d", &N[0], &N[1]); ) {
    for (int h = 0; h < 2; ++h) for (int i = 0; i < N[h]; ++i) {
      scanf("%lld", &A[h][i]);
    }
    
    for (int h = 0; h < 2; ++h) {
      for (int i = 0; i < N[h]; ++i) {
        for (int p = 0; p < 1 << i; ++p) {
          ASum[h][p | 1 << i] = ASum[h][p] + A[h][i];
        }
      }
    }
    
    for (int h = 0; h < 2; ++h) {
      for (int i0 = 0; i0 < N[0]; ++i0) for (int i1 = 0; i1 < N[1]; ++i1) {
        cache[h][i0][i1].clear();
      }
    }
    Double ans[2] = {};
    for (int h = 0; h < 2; ++h) if (N[h] >= N[h ^ 1]) {
// cerr<<"start turn = "<<h<<endl;
      const auto res = solve(h, 0, 0, vector<int>(N[0] + N[1], 0));
      ans[0] += res.first;
      ans[1] += res.second;
    }
    if (N[0] == N[1]) {
      for (int h = 0; h < 2; ++h) {
        ans[h] /= 2.0;
      }
    }
    
    printf("%.12f\n", ans[0]);
    printf("%.12f\n", ans[1]);
    printf("%.12f\n", 1.0 - (ans[0] + ans[1]));
  }
  return 0;
}