#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
using namespace std;
typedef long long int ll;
//typedef pair<int, int> P;
const double PI=acos(-1.0);
int n;
double l[1002];
double arg(double a, double b, double c){
	return acos((a*a+b*b-c*c)/(2*a*b));
}
double triarea(double a, double b, double c){
	double t=arg(a, b, c);
	return a*b*sin(t)/2;
}
double intersection(double r1, double r2){
	if(r1+r2<=l[0]) return 0;
	if(r2-r1>=l[0]) return r1*r1*PI;
	if(r1-r2>=l[0]) return r2*r2*PI;
	double s1=r1*r1*PI, s2=r2*r2*PI;
	double t1=arg(r1, l[0], r2), t2=arg(r2, l[0], r1);
	double s=s1*(PI-t1)/PI+s2*(PI-t2)/PI+2*triarea(r1, r2, l[0]);
	return s1+s2-s;
}
int main()
{
	cin>>n;
	for(int i=0; i<=n+1; i++) cin>>l[i];
	double mx1[1002], s[1002], mx2[1002]; mx1[1]=l[1], s[0]=0, s[1]=l[1];
	for(int i=2; i<=n+1; i++){
		mx1[i]=max(mx1[i-1], l[i]);
		s[i]=s[i-1]+l[i];
	}
	mx2[n]=l[n+1];
	for(int i=n-1; i>=1; i--){
		mx2[i]=max(mx2[i+1], l[i+1]);
	}
	for(int i=1; i<=n; i++){
		double s1=s[i], t1=max(0.0, 2*mx1[i]-s1);
		double s2=s[n+1]-s[i], t2=max(0.0, 2*mx2[i]-s2);
		double ans=intersection(s1, s2)+intersection(t1, t2)-intersection(s1, t2)-intersection(s2, t1);
		printf("%.7lf\n", ans);
	}
	return 0;
}