#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
using namespace std;

template<class A> string to_string(A v) {
	string res = "{";
	int first = 1;
	for (const auto &x: v) {
		if (first == 0) res += ", ";
		res += to_string(x);
		first = 0;
	}
	res += "}";
	return res;
}

void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: "; debug_out(__VA_ARGS__)

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;


int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	using T = double;
	vector<T> xs(4), ys(4), zs(4);
	while (cin >> xs[0] >> ys[0] >> zs[0]) {
		rep(i, 1, 3) cin >> xs[i] >> ys[i] >> zs[i];
		if (xs[1] < xs[0]) {
			for (auto &x: xs) x *= -1;
		}
		if (ys[1] < ys[0]) {
			for (auto &x: ys) x *= -1;
		}
		if (zs[1] < zs[0]) {
			for (auto &x: zs) x *= -1;
		}
		T ox = xs[0], oy = ys[0], oz = zs[0];
		for (auto &x: xs) x -= ox;
		for (auto &x: ys) x -= oy;
		for (auto &x: zs) x -= oz;
		if (xs[2] > xs[3]) swap(xs[2], xs[3]);
		if (ys[2] > ys[3]) swap(ys[2], ys[3]);
		if (zs[2] > zs[3]) swap(zs[2], zs[3]);
		chmax(xs[2], xs[0]); chmin(xs[3], xs[1]);
		chmax(ys[2], ys[0]); chmin(ys[3], ys[1]);
		chmax(zs[2], zs[0]); chmin(zs[3], zs[1]);
		if (xs[2] > xs[3] || ys[2] > ys[3] || zs[2] > zs[3]) {
			puts("0");
		} else{
			T X = xs[1], Y = ys[1], Z = zs[1];
			T d = 1;
			T a = -d / X;
			T b = -d / Y;
			T c = -d / Z;
			
			auto cal = [&](T x, T y, T z) -> T {
				if (a * x + b * y + c * z + d <= 0) return 0;
				T res = 1.0;
				res *= (-d - b * y - c * z) / a - x;
				res *= (-d - a * x - c * z) / b - y;
				res *= (-d - a * x - b * y) / c - z;
				return res / 6.0;
			};
			T ans = 0;
			rep(i, 0, 1) rep(j, 0, 1) rep(k, 0, 1) {
				T res = cal(xs[2 + i], ys[2 + j], zs[2 + k]);
				if ((i + j + k) & 1) ans -= res;
				else ans += res;
			}
			printf("%.10f\n", ans);
		}

	}
	return 0;
}