// Qzong！！！！！！！！！！！！！！！！！！！！！！！
#include<cstdio>
#include<cmath>
const int N=15000000,M=N>>1;
const double pi=acos(-1);
struct node{
    double x,y,z;
    node operator+(const node &a)const {return node{x+a.x,y+a.y,z+a.z};}
    node operator/(const double a)const {return node{x/a,y/a,z/a};}
    node operator-(const node &A)const {return node{x-A.x,y-A.y,z-A.z};}
    node operator*(const double a)const {return node{x*a,y*a,z*a};}
}ear,sun,moon,a1,a2,d1,d2,d3,tmp;
double er,mr,sr,C[N+20],S[N+20],H[N+20],R[N+20],Ans[3];
int now;
double dot(const node &a,const node &b){
    return a.x*b.x+a.y*b.y+a.z*b.z;
}
node cro(const node &a,const node &b){
    return node{a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x};
}
double dis(const node &a){
    return a.x*a.x+a.y*a.y+a.z*a.z;
}
bool check(const node &a,const node &b){
    return dis(cro(sun-a,sun-b))>=sr*sr*dis(a-b);
}
void go(int op,node t){
    int l=now,r=N-now,i;
    for(i=1;i<=N;i++){
        while(l<r&&(tmp=node{C[l]*R[i],S[l]*R[i],H[i]},dot(tmp,d3-tmp)<0||check(tmp,t)))l++;
        while(l<r&&(tmp=node{C[r]*R[i],S[r]*R[i],H[i]},dot(tmp,d3-tmp)<0||check(tmp,t)))r--;
        if(l>=r)return;
        Ans[op?2:S[r]*R[i]<t.y]+=(r-l)*pi*er*er/N/M;
    }
}
int main(){
    scanf("%lf%lf%lf%lf%lf%lf",&er,&sun.y,&sr,&moon.x,&moon.y,&mr),C[0]=1;
    d1=(moon-sun)/(sr-mr)*sr+sun,d2=(sun-moon)/(sr+mr)*mr+moon,d3=sun*er/(sr+er);
    for(int i=1;i<=N;i++)
        C[i]=cos(pi*i/N),S[i]=sin(pi*i/N),H[i]=(i-0.5)*er/N,R[i]=sqrt(er*er-H[i]*H[i]);
    while(tmp=node{C[now],S[now],0}*er,dot(tmp,d3-tmp)<0)now++;
    go(1,d2);
    go(0,d1);
    printf("%.2lf %.2lf %.2lf\n",Ans[0],Ans[1],Ans[2]-Ans[1]-Ans[0]);
    return 0;
}