import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum EPS = 1e-10;

int N;
real[] L;

real calc(real r, real s) {
  if (r - s >= L[0] - EPS) return PI * s * s;
  if (s - r >= L[0] - EPS) return PI * r * r;
  if (r + s <= L[0] + EPS) return 0.0;
  const x = (L[0]^^2 + r^^2 - s^^2) / (2 * L[0]);
  const h = sqrt(r^^2 - x^^2);
  return r^^2 * atan2(h, x) + s^^2 * atan2(h, L[0] - x) - L[0] * h;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      L = new real[N + 2];
      foreach (i; 0 .. N + 2) {
        L[i] = readReal();
      }
      auto ans = new real[N + 2];
      foreach (i; 1 .. N + 1) {
        const maxL = L[1 .. i + 1].maxElement;
        const sumL = L[1 .. i + 1].sum;
        const aL = max(maxL - (sumL - maxL), 0.0);
        const bL = sumL;
        const maxR = L[i + 1 .. N + 2].maxElement;
        const sumR = L[i + 1 .. N + 2].sum;
        const aR = max(maxR - (sumR - maxR), 0.0);
        const bR = sumR;
        debug {
          writefln("%s: [%s, %s] [%s, %s]", i, aL, bL, aR, bR);
        }
        ans[i] = 0.0;
        ans[i] += calc(aL, aR);
        ans[i] -= calc(aL, bR);
        ans[i] -= calc(bL, aR);
        ans[i] += calc(bL, bR);
      }
      foreach (i; 1 .. N + 1) {
        writefln("%.10f", ans[i]);
      }
    }
  } catch (EOFException e) {
  }
}