#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int nrep = 30;
const double EPS = 1e-10;
const double INF = 1e12;
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()

typedef complex<double> P;
typedef vector<P> VP;
struct L : VP{
    L(const P& a, const P& b){ resize(2); at(0)=a; at(1)=b; }
    L(){ resize(2); }
};
struct C{
    P p;
    double r;
    C(const P& p, const double& r) : p(p), r(r) {}
    C(){}
};

double dot(P a, P b){
    return (conj(a)*b).X;
}
double cross(P a, P b){
    return (conj(a)*b).Y;
}

P projection(const L& l, const P& p) {
    double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);
    return l[0] + t*(l[0]-l[1]);
}
double distanceLP(const L &l, const P &p) {
    return abs(p - projection(l, p));
}

int main(){
	while(1){
		vector<int> input(6);
		bool allzero = true;
		for(int i=0; i<6; i++){
			cin >> input[i];
			if(input[i]!=0) allzero = false;
		}
		if(allzero) break;
		
		VP v(3);
		for(int i=0; i<3; i++){
			v[i] = P(input[2*i], input[2*i+1]);
		}
		
		VP bisection(3);
		for(int i=0; i<3; i++){
			double a = abs(v[(i+1)%3] -v[i]), b = abs(v[(i+2)%3] -v[i]);
			bisection[i] = v[(i+1)%3] + (v[(i+2)%3]-v[(i+1)%3])* a/(a+b);
		}
		
		C c[3];
		P b = v[0], e = bisection[0];
		for(int i=0; i<nrep; i++){
			P mid = 0.5*(b+e);
			c[0] = C(mid, distanceLP(L(v[0], v[1]), mid));
			if(distanceLP(L(v[1], v[2]), mid) < c[0].r +EPS){
				e = mid;
				continue;
			}
			for(int j=1; j<=2; j++){
				P b = v[j], e = bisection[j];
				for(int k=0; k<nrep; k++){
					P mid = 0.5*(b+e);
					c[j] = C(mid, distanceLP(L(v[1], v[2]), mid));
					if(distanceLP(L(v[(j+1)%3], v[(j+2)%3]), mid) < c[j].r +EPS){
						e = mid;
						continue;
					}
					if(abs(c[0].p -c[j].p) < c[0].r+c[j].r){
						e = mid;
					}else{
						b = mid;
					}
				}
			}
			if(abs(c[1].p -c[2].p) < c[1].r+c[2].r){
				b = mid;
			}else{
				e = mid;
			}
		}
		
		cout << fixed;
		cout << setprecision(10);
		cout << c[0].r << " " << c[1].r << " " << c[2].r << endl;
	}
	return 0;
}