The Bad Luck Island is inhabited by three kinds of species: *r* rocks, *s* scissors and *p* papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably), and if they belong to different species, then one individual kills the other one: a rock kills scissors, scissors kill paper, and paper kills a rock. Your task is to determine for each species what is the probability that this species will be the only one to inhabit this island after a long enough period of time.
The single line contains three integers *r*, *s* and *p* (1 ≤ *r*, *s*, *p* ≤ 100) — the original number of individuals in the species of rock, scissors and paper, respectively.
r, s, p = map(int, input().split())

dp = [[[0] * 101 for i in range(101)] for i in range(101)]
dp[r][s][p] = 1
for i in range(r, -1, -1):
    for j in range(s, -1, -1):
        for k in range(p, -1, -1):
            s_dies = i * j
            p_dies = j * k
            r_dies = k * i
            all_ = s_dies + p_dies + r_dies
            if all_ == 0:
                continue
            if i > 0:
                dp[i - 1][j][k] += dp[i][j][k] * r_dies / all_
            if j > 0:
                dp[i][j - 1][k] += dp[i][j][k] * s_dies / all_
            if k > 0:
                dp[i][j][k - 1] += dp[i][j][k] * p_dies / all_
            

sm = 0
for i in range(1, r + 1):
    sm += dp[i][0][0]
print(sm, end = " ")
sm = 0
for i in range(1, s + 1):
    sm += dp[0][i][0]
print(sm, end = " ")
sm = 0
for i in range(1, p + 1):
    sm += dp[0][0][i]
print(sm)