/////////////////////////////////
#include <bits/stdc++.h>
using db = long double;
int main() {
	// freopen("in.txt", "r", stdin);
	std::ios::sync_with_stdio(false), std::cin.tie(0);
	int x1, y1, y2;
	int rl, gl, bl;
	std::cin >> x1 >> y1 >> y2;
	std::cin >> rl >> gl >> bl;
	int x2, y3, y4;
	int rr, gr, br;
	std::cin >> x2 >> y3 >> y4;
	std::cin >> rr >> gr >> br;
	std::array<db, 3> ans{};
	auto check = [&] (db x) {
		db t = (x - x1) / (x2 - x1);
		db r = rl * (1 - t) + rr * t;
		db g = gl * (1 - t) + gr * t;
		db b = bl * (1 - t) + br * t;
		if(r >= 150 && g <= 75 && b <= 75) return 0;
		if(g >= 150 && r <= 75 && b <= 75) return 1;
		if(b >= 150 && r <= 75 && g <= 75) return 2;
		return -1;		
	};
	auto len = [&] (db x) {
		db t = (x - x1) / (x2 - x1);
		return y2 * (1 - t) + y4 * t - y1 * (1 - t) - y3 * t;
	};
	auto calc = [&] (db l, db r) {
		db a = len(l), b = len(r);
		return (a + b) * (r - l) / 2;
	};
	std::vector<db> v;
	auto solve = [&] (db l, db r) {
		std::vector<std::tuple<db, db, int>> range;
		if(l >= 150 && r >= 150) {
			range.emplace_back(x1, x2, 1);
		} else if(l >= 150) {
			range.emplace_back(x1, x1 + (x2 - x1) * (l - 150) / (l - r), 1);
		} else if(r >= 150) {
			range.emplace_back(x2 - (x2 - x1) * (r - 150) / (r - l), x2, 1);
		}
		
		if(l <= 75 && r <= 75) {
			range.emplace_back(x1, x2, -1);
		} else if(l <= 75) {
			range.emplace_back(x1, x1 + (x2 - x1) * (75 - l) / (r - l), -1);
		} else if(r <= 75) {
			range.emplace_back(x2 - (x2 - x1) * (75 - r) / (l - r), x2, -1);
		}
		for(auto [l, r, o] : range) {
			v.emplace_back(l);
			v.emplace_back(r);
		}
		return range;
	};
	auto r = solve(rl, rr);
	auto g = solve(gl, gr);
	auto b = solve(bl, br);
	std::sort(v.begin(), v.end());
	v.erase(std::unique(v.begin(), v.end()), v.end());
	std::vector<std::vector<int>> c(3, std::vector<int> (v.size()));
	int id = 0;
	for(auto vec : {r, g, b}) {
		for(auto [l, r, o] : vec) {
			l = std::lower_bound(v.begin(), v.end(), l) - v.begin();
			r = std::lower_bound(v.begin(), v.end(), r) - v.begin();
			for(int i = l; i < r; i ++) {
				c[id][i] = o;
			}
		}
		id ++;
	}
	for(int i = 0; i < v.size(); i ++) {
		if(c[0][i] == 1 && c[1][i] == -1 && c[2][i] == -1) ans[0] += calc(v[i], v[i + 1]);
		if(c[0][i] == -1 && c[1][i] == 1 && c[2][i] == -1) ans[1] += calc(v[i], v[i + 1]);
		if(c[0][i] == -1 && c[1][i] == -1 && c[2][i] == 1) ans[2] += calc(v[i], v[i + 1]);
	}
	std::cout << std::fixed << std::setprecision(10);
	for(int i = 0; i < 3; i ++) {
		std::cout << ans[i] << '\n';
	}	
	return 0;
}