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, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def f(u, v, w):
    return (u * (s + 1) + v) * (p + 1) + w

r, s, p = map(int, input().split())
n = (r + 1) * (s + 1) * (p + 1)
dp = [0] * n
dp[f(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):
            x = i * j + j * k + k * i
            dp0 = dp[f(i, j, k)]
            if not x:
                if i > j == k == 0:
                    dp[f(i - 1, 0, 0)] += dp0
                if j > k == i == 0:
                    dp[f(0, j - 1, 0)] += dp0
                if k > i == j == 0:
                    dp[f(0, 0, k - 1)] += dp0
            else:
                dp[f(i - 1, j, k)] += dp0 * k * i / x
                dp[f(i, j - 1, k)] += dp0 * i * j / x
                dp[f(i, j, k - 1)] += dp0 * j * k / x
ans = [dp[f(1, 0, 0)], dp[f(0, 1, 0)], dp[f(0, 0, 1)]]
sys.stdout.write(" ".join(map(str, ans)))