#include <bits/stdc++.h>
using namespace std;

#define dump(n) cout<<"# "<<#n<<'='<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;

const int INF=1e9;
const int MOD=1e9+7;
const double EPS=1e-9;

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& a){
	os<<'[';
	rep(i,a.size()) os<<(i?" ":"")<<a[i];
	return os<<']';
}

const double PI=acos(-1);

struct Point{
	double x,y;
	Point(){}
	Point(double x,double y):x(x),y(y){}
	Point& operator+=(Point p){x+=p.x,y+=p.y; return *this;}
	Point& operator-=(Point p){x-=p.x,y-=p.y; return *this;}
	Point& operator*=(double c){x*=c,y*=c; return *this;}
	Point& operator/=(double c){x/=c,y/=c; return *this;}
};
Point operator+(Point a,Point b){return a+=b;}
Point operator-(Point a,Point b){return a-=b;}
Point operator*(Point a,double c){return a*=c;}
Point operator*(double c,Point a){return a*=c;}
Point operator/(Point a,double c){return a/=c;}
bool operator==(Point a,Point b){return abs(a.x-b.x)<EPS && abs(a.y-b.y)<EPS;}
bool operator!=(Point a,Point b){return !(a==b);}

double Abs(Point p){
	return sqrt(p.x*p.x+p.y*p.y);
}
double Abs2(Point p){
	return p.x*p.x+p.y*p.y;
}
double Arg(Point p){
	return atan2(p.y,p.x);
}
double Dot(Point a,Point b){
	return a.x*b.x+a.y*b.y;
}
double Cross(Point a,Point b){
	return a.x*b.y-a.y*b.x;
}
Point Rot(Point p,double t){
	return Point(cos(t)*p.x-sin(t)*p.y,sin(t)*p.x+cos(t)*p.y);
}

struct Line{
	Point pos,dir;
	Line(){}
	Line(Point p,Point d):pos(p),dir(d){}
	Line(double x,double y,double u,double v):pos(x,y),dir(u,v){}
};

ostream& operator<<(ostream& os,const Point& p){
	return os<<'('<<p.x<<','<<p.y<<')';
}
ostream& operator<<(ostream& os,const Line& l){
	return os<<'('<<l.pos<<','<<l.dir<<')';
}

int main()
{
	for(Point ps[3];;){
		rep(i,3) cin>>ps[i].x>>ps[i].y;
		if(count(all(ps),Point(0,0))==3) break;
		
		Point ds[3]; // 二等分線の方向ベクトル
		double ts[3]; // 角度
		rep(i,3){
			Point d1=ps[(i+1)%3]-ps[i],d2=ps[(i+2)%3]-ps[i];
			ts[i]=acos(Dot(d1,d2)/(Abs(d1)*Abs(d2)));
			ds[i]=Rot(d1,ts[i]/2)/Abs(d1);
		}
		double s=Cross(ps[1]-ps[0],ps[2]-ps[0])/2; // 面積
		double h=2*s/(Abs(ps[1]-ps[0])+Abs(ps[2]-ps[1])+Abs(ps[0]-ps[2])); // 内接円の半径
		
		double r[3];
		double lo=0,hi=h;
		rep(_,50){
			r[0]=(lo+hi)/2;
			Point q[3]={ps[0]+r[0]/sin(ts[0]/2)*ds[0]};
			
			repi(i,1,3){
				double lo=0,hi=h;
				rep(_,50){
					r[i]=(lo+hi)/2;
					q[i]=ps[i]+r[i]/sin(ts[i]/2)*ds[i];
					if(Abs(q[i]-q[0])<r[0]+r[i])
						hi=r[i];
					else
						lo=r[i];
				}
			}
			// q[1]とq[2]の距離が半径の和より小さかったら，r[0]を大きくする必要がある
			if(Abs(q[2]-q[1])<r[1]+r[2])
				lo=r[0];
			else
				hi=r[0];
		}
		printf("%f %f %f\n",r[0],r[1],r[2]);
	}
}

Measured memory_bytes: 1316