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

using ld = long double;
using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

struct usu {
  ld pa, pb, pt;

  usu& operator += (usu &&aux) {
    pa += aux.pa;
    pb += aux.pb;
    pt += aux.pt;
    return *this;
  }

  usu& operator / (int x) {
    pa /= x;
    pb /= x; 
    pt /= x; 

    return *this;
  }
};

usu back(int &t, int ia, int ib, int ra, int rb, vector<pair<int, int>> &a, vector<pair<int, int>> &b) {
  if (ra == 0 && rb == 0) {
    return {0, 0, 1};
  }

  if (ra == 0) {
    return {0, 1, 0};
  }

  if (rb == 0) {
    return {1, 0, 0};
  }

  if (ia == a.size())
    ia = 0;

  while (a[ia].first <= 0) {
    ++ia;
    if (ia == a.size())
      ia = 0;
  }

  usu p = {0, 0, 0};
  int nr = 0;
  for (auto &it : b) {
    if (it.first > 0) {
      a[ia].first -= it.second;
      it.first -= a[ia].second;
      p += back(t, ib, ia + 1, rb - (it.first <= 0), ra - (a[ia].first <= 0), b, a);
      a[ia].first += it.second;
      it.first += a[ia].second;
      ++nr;
    }
  }

  swap(p.pa, p.pb);
  p = p / nr;

  return p;
}

void solve() {
  int n, m;
  cin >> n >> m;

  vector<pair<int, int>> a(n), b(m);

  for (auto &it : a) {
    cin >> it.first;
    it.second = it.first;
  }
  
  for (auto &it : b) {
    cin >> it.first;
    it.second = it.first;
  }

  int t, wa, wb;
  t = wa = wb = 0;

  usu p = {0, 0, 0};
  int nr = 0;
  if (a.size() >= b.size()) {
    p += back(t, 0, 0, n, m, a, b);
    nr++;
  }

  swap(p.pa, p.pb);
  if (b.size() >= a.size()) {
    p += back(t, 0, 0, m, n, b, a);
    nr++;
  }
  swap(p.pa, p.pb);

  p = p / nr;

  int tot = wa + wb + t;
  cout << fixed << setprecision(18) << p.pa << "\n";
  cout << fixed << setprecision(18) << p.pb << "\n";
  cout << fixed << setprecision(18) << p.pt << "\n";
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
//  cin >> t;
  while (t--)
    solve();

  return 0;
}