#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <queue>
#include <map>
#include <set>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <cassert>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;

const double EPS = 1e-8;
const double PI = acos(-1);
typedef complex<double> P;
namespace std {
  bool operator < (const P& a, const P& b) {
    return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
  }
}
double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}
double dot(const P& a, const P& b) {
  return real(conj(a)*b);
}

struct L : public vector<P> {
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
};

typedef vector<P> G;

struct C {
  P p; double r;
  C(const P &p, double r) : p(p), r(r) { }
};

int ccw(P a, P b, P c) {
  b -= a; c -= a;
  if (cross(b, c) > 0)   return +1;       // counter clockwise
  if (cross(b, c) < 0)   return -1;       // clockwise
  if (dot(b, c) < 0)     return +2;       // c--a--b on line
  if (norm(b) < norm(c)) return -2;       // a--b--c on line
  return 0;
}

bool intersectLL(const L &l, const L &m) {
  return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel
         abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;   // same line
}
bool intersectLS(const L &l, const L &s) {
  return cross(l[1]-l[0], s[0]-l[0])*       // s[0] is left of l
         cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l
}
bool intersectLP(const L &l, const P &p) {
  return abs(cross(l[1]-p, l[0]-p)) < EPS;
}
bool intersectSS(const L &s, const L &t) {
  return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&
         ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;
}
bool intersectSP(const L &s, const P &p) {
  return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality
}

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]);
}
P reflection(const L &l, const P &p) {
  return p + P(2,0) * (projection(l, p) - p);
}
double distanceLP(const L &l, const P &p) {
  return abs(p - projection(l, p));
}
double distanceLL(const L &l, const L &m) {
  return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);
}
double distanceLS(const L &l, const L &s) {
  if (intersectLS(l, s)) return 0;
  return min(distanceLP(l, s[0]), distanceLP(l, s[1]));
}
double distanceSP(const L &s, const P &p) {
  const P r = projection(s, p);
  if (intersectSP(s, r)) return abs(r - p);
  return min(abs(s[0] - p), abs(s[1] - p));
}
double distanceSS(const L &s, const L &t) {
  if (intersectSS(s, t)) return 0;
  return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),
             min(distanceSP(t, s[0]), distanceSP(t, s[1])));
}
P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
  if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
  return m[0] + B / A * (m[1] - m[0]);
}

double bi_search(double lb, double ub, bool (*ok)(double)) {
  REP(i,100) { // ±±ÍKÉ
    double mid = (lb+ub)/2;
    if (ok(mid)) lb = mid;
    else ub = mid;
  }
  return ub;
}

double calct(P a, P b, double r, double ang) {
  double A = norm(a) * cos(ang/2) * cos(ang/2);
  double B = - 2 * (dot(a, b) + r * abs(a) * sin(ang/2));
  double C = norm(b) - r * r;

  assert(A!=0);
  assert(B*B-4*A*C>=0);

  double res = (-B - sqrt(B*B-4*A*C)) / (2*A);
  
  return res;
}

double ang(P a, P b) {        // xNg©çÝ½xNgÌpxÌvZ[0,2pi]
  double ret1 = arg(b)-arg(a);
  ret1 = (ret1>=0) ? ret1 : ret1 + 2*PI;
  double ret2 = arg(a)-arg(b);
  ret2 = (ret2>=0) ? ret2 : ret2 + 2*PI;
  return min(ret1, ret2);
}

P point[3];

double ans[3];

bool ok(double r) {
  P a = point[1] - point[0]; a /= abs(a);
  P b = point[2] - point[0]; b /= abs(b);
  P c = a+b; c /= abs(c);
  c *= r / sin(ang(a,b)/2);
  double len = abs(c) * cos(ang(a,b)/2);
  if (len >= abs(point[1]-point[0])-EPS || len >= abs(point[2] - point[0])-EPS)
    return 0;
  c += point[0];
  
  a = point[0] - point[1]; a /= abs(a);
  b = point[2] - point[1]; b /= abs(b);
  double t = calct(a+b, c-point[1], r, ang(a,b));
  
  P d1 = t*(a+b);
  double r1 = abs(d1) * sin(ang(a,b)/2);
  a = point[0] - point[2]; a /= abs(a);
  b = point[1] - point[2]; b /= abs(b);
  t = calct(a+b, c-point[2], r, ang(a,b));
  P d2 = t*(a+b);
  double r2 = abs(d2) * sin(ang(a,b)/2);
  d2 += point[2] - point[1];

  ans[0] = r;
  ans[1] = r1;
  ans[2] = r2;

  // cout << c << " " << point[1] + d1 << " " << point[2] + d1 << endl;
  // cout << r << " " << r1 << " " << r2 << endl;
  // cout << abs(d1 - d2) << " " << r1 + r2 << endl;
  return abs(d1 - d2) < r1 + r2;
}

int main() {
  while(1) {
    bool f = 0;
    REP(i, 3) {
      double x, y;
      cin >> x >> y;
      if (x||y) f = 1;
      point[i] = P(x, y);
    }
    if (!f) break;
    
    bi_search(0, 5000, ok);
    printf("%.12f %.12f %.12f\n", ans[0], ans[1], ans[2]);
  }
}