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

int n, m, aa[11], bb[11];

vector<pair<int, int>> a, b;

using shit = pair<vector<pair<int, int>>, vector<pair<int, int>>>;

struct Hasher
{
  std::size_t operator()(const shit& k) const
  {
    using std::hash;
    size_t h = 0;
    for (auto &it : k.first) {         
    	h = h * 31 + hash<int>()(it.first);
    	h = h * 31 + hash<int>()(it.second);
    }
    for (auto &it : k.second) {         
    	h = h * 31 + hash<int>()(it.first);
    	h = h * 31 + hash<int>()(it.second);
    }
    return h;
  }
};

unordered_map<pair<vector<pair<int, int>>, vector<pair<int, int>>>, pair<double, double>, Hasher> dp[2][7][7];
    
pair<double, double> solve(vector<pair<int, int>> a, vector<pair<int, int>> b, int pos1, int pos2, bool f) {
	if (a.size() == 0 && b.size() == 0)
		return {0.0, 0.0};
 	if (a.size() == 0)
 		return {0.0, 1.0};
 	if (b.size() == 0)
 		return {1.0, 0.0};
	if (dp[f][pos1][pos2].find({a, b}) != dp[f][pos1][pos2].end())
		return dp[f][pos1][pos2][{a, b}];
	pair<double, double> res = {0.0, 0.0};
	if (!f) {
		int mn = n, pp = -1;
		for (int i = 0; i < (int)a.size(); ++i) {
			if ((a[i].second - pos1 + n) % n < mn) {
				mn = (a[i].second - pos1 + n) % n;
				pp = i;
			}
		}
		for (int i = 0; i < (int)b.size(); ++i) {
			vector<pair<int, int>> toa, tob;
			
			for (int j = 0; j < (int)a.size(); ++j) {
				if (j == pp && a[pp].first - bb[b[i].second] > 0)
					toa.push_back({a[pp].first - bb[b[i].second], a[pp].second});
				if (j == pp)
					continue;
				toa.push_back({a[j].first, a[j].second});
			}
			for (int j = 0; j < (int)b.size(); ++j) {
				if (j == i && b[i].first - aa[a[pp].second] > 0)
					tob.push_back({b[i].first - aa[a[pp].second], b[i].second});
				if (j == i)
					continue;
				tob.push_back({b[j].first, b[j].second});
			}
      
			auto cur = solve(toa, tob, (a[pp].second + 1) % n, pos2, f ^ 1);
			res.first += cur.first;
			res.second += cur.second;
    }
    res.first /= b.size() * 1.0;
	  res.second /= b.size() * 1.0;
	} else {
		int mn = m, pp = -1;
		for (int i = 0; i < (int)b.size(); ++i) {
			if ((b[i].second - pos2 + m) % m < mn) {
				mn = (b[i].second - pos2 + m) % m;
				pp = i;
			}
		}
		
		for (int i = 0; i < (int)a.size(); ++i) {
			vector<pair<int, int>> toa, tob;
			for (int j = 0; j < (int)b.size(); ++j) {
				if (j == pp && b[pp].first - aa[a[i].second] > 0)
					tob.push_back({b[pp].first - aa[a[i].second], b[pp].second});
				if (j == pp)
					continue;
				tob.push_back({b[j].first, b[j].second});
			}
			for (int j = 0; j < (int)a.size(); ++j) {
				if (j == i && a[i].first - bb[b[pp].second] > 0)
					toa.push_back({a[i].first - bb[b[pp].second], a[i].second});
				if (j == i)
					continue;
				toa.push_back({a[j].first, a[j].second});
			}
			
			auto cur = solve(toa, tob, pos1, (b[pp].second + 1) % m, f ^ 1);
			res.first += cur.first;
			res.second += cur.second;
		} 	
		res.first /= a.size() * 1.0;
  	res.second /= a.size() * 1.0;
  }
  return dp[f][pos1][pos2][{a, b}] = res;
}    

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout << setprecision(12) << fixed;
#ifdef LOCAL
    freopen("xxx.in", "r", stdin);
    freopen("xxx.out", "w", stdout);
#endif
	cin >> n >> m;
	for (int i = 0; i < n; ++i) {
		cin >> aa[i];
		a.push_back({aa[i], i});
	}
	for (int i = 0; i < m; ++i) {
		cin >> bb[i];
		b.push_back({bb[i], i});
	}
	pair<double, double> res = {0.0, 0.0};
  if (n < m)
  	res = solve(a, b, 0, 0, 1);
  if (n > m)
  	res = solve(a, b, 0, 0, 0);
  if (n == m) {
  	auto res1 = solve(a, b, 0, 0, 0);
  	auto res2 = solve(a, b, 0, 0, 1);
  	res.first = (res1.first + res2.first) / 2.0;
  	res.second = (res1.second + res2.second) / 2.0;
  }	
  cout << res.first << "\n" << res.second << "\n" << (1.0 - res.first - res.second) << "\n";  
  return 0;
}