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.
import sys
input = sys.stdin.readline

R, S, P = map(int, input().split())
dp = [[[0]*(P + 1) for _ in range(S + 1)] for _ in range(R + 1)]
dp[R][S][P] = 1
for r in range(R, -1, -1):
    for s in range(S, -1, -1):
        for p in range(P, -1, -1):
            sm = r * s + s * p + p * r
            if r and s:
                dp[r][s - 1][p] += (r * s / sm) * dp[r][s][p]
            if s and p:
                dp[r][s][p - 1] += (s * p / sm) * dp[r][s][p]
            if p and r:
                dp[r - 1][s][p] += (p * r / sm) * dp[r][s][p]
ans1, ans2, ans3 = 0, 0, 0
for i in range(R + 1):
    ans1 += dp[i][0][0]
for i in range(S + 1):
    ans2 += dp[0][i][0]
for i in range(P + 1):
    ans3 += dp[0][0][i]
print(ans1, ans2, ans3)
