#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef double db;
struct P {
  db x, y, z;
}d[4];
const db K = 6.0;
db siz;
double gs(double s, vector<double> g) {
  if (s + g[0] >= 100) {
    double q = 100 - s;
    double ans = q * q * q;
    return ans / K / siz;
  }
  else if (s + g[1] >= 100) {
    double q = 100 - s;
    double ans = q * q * q;
    double r = q - g[0];
    ans -= r * r * r;
    return ans / K / siz;
  }
  else if (s + g[2] >= 100) {
    if (s + g[0] + g[1] >= 100) {
      double q = 100 - s;
      double ans = q * q * q;
      double r = q - g[0];
      ans -= r * r * r;
      r = q - g[1];
      ans -= r * r * r;
      return ans / K / siz;
    }
    else {
      double q = 100 - s;
      double ans = q * q * q;
      double r = q - g[0];
      ans -= r * r * r;
      r = q - g[1];
      ans -= r * r * r;
      r = q - g[0] - g[1];
      ans += r * r * r;
      return ans / K / siz;
    }
  }
  else {
      double q = 100 - s;
      double ans = q * q * q;
      double r = q - g[0];
      ans -= r * r * r;
      r = q - g[1];
      ans -= r * r * r;
      r = q - g[2];
      ans -= r * r * r;
      return ans / K / siz;
  }
}
void solve() {
  for (int i = 1; i < 4; i++) {
    scanf("%lf%lf%lf", &d[i].x, &d[i].y, &d[i].z);
    d[i].x -= d[0].x;
    d[i].y -= d[0].y;
    d[i].z -= d[0].z;
  }
  double fx = 100 / d[1].x;
  double fy = 100 / d[1].y;
  double fz = 100 / d[1].z;
  siz = abs(fx * fy * fz);
  for (int i = 2; i < 4; i++) {
    d[i].x *= fx;
    d[i].y *= fy;
    d[i].z *= fz;
  }
  d[0].x = min(d[2].x, d[3].x);
  d[0].y = min(d[2].y, d[3].y);
  d[0].z = min(d[2].z, d[3].z);
  
  d[0].x = max(0.0, d[0].x);
  d[0].y = max(0.0, d[0].y);
  d[0].z = max(0.0, d[0].z);
  
  d[1].x = max(d[2].x, d[3].x) - d[0].x;
  d[1].y = max(d[2].y, d[3].y) - d[0].y;
  d[1].z = max(d[2].z, d[3].z) - d[0].z;
  
  if (d[1].x < 0 || d[1].y < 0 || d[1].z < 0) {
    printf("0\n");
    return ;
  }
  
  double s = d[0].x + d[0].y + d[0].z;
  if (s >= 100) {
    printf("0\n");
    return ;
  }
  
  vector<db> g(3);
  g[0] = d[1].x; g[1] = d[1].y; g[2] = d[1].z;
  sort(g.begin(), g.end());
  /*for (int i = 0; i < 3; i++)
    printf("%.6lf!!\n", g[i]);
  printf("%.6lf?!!\n", s);*/
  if (s + g[0] + g[1] + g[2] <= 100) {
    printf("%.9lf\n", g[0] * g[1] * g[2] / siz);
    return ;
  }
  else if (s + g[0] >= 100) {
    double q = 100 - s;
    double ans = q * q * q;
    printf("%.9lf\n", ans / K / siz);
    return ;
  }
  else if (s + g[1] >= 100) {
    double q = 100 - s;
    double ans = q * q * q;
    double r = q - g[0];
    ans -= r * r * r;
    printf("%.9lf\n", ans / K / siz);
    return ;
  }
  else if (s + g[2] >= 100) {
    if (s + g[0] + g[1] >= 100) {
      double q = 100 - s;
      double ans = q * q * q;
      double r = q - g[0];
      ans -= r * r * r;
      r = q - g[1];
      ans -= r * r * r;
      printf("%.9lf\n", ans / K / siz);
    }
    else {
      double q = 100 - s;
      double ans = q * q * q;
      double r = q - g[0];
      ans -= r * r * r;
      r = q - g[1];
      ans -= r * r * r;
      r = q - g[0] - g[1];
      ans += r * r * r;
      printf("%.9lf\n", ans / K / siz);
    }
    return ;
  }
  else {
    double res = 200 - (s + g[0] + g[1] + g[2]);
    printf("%.9lf\n", g[0] * g[1] * g[2] / siz - gs(res, g));
  }
}
int main() {
  while (scanf("%lf%lf%lf", &d[0].x, &d[0].y, &d[0].z) != EOF)
    solve();
  return 0;
}