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())
n = 101
m = n * n
t = [0] * n * m

for i in range(1, n):
    for j in range(n):
        for k in range(n):
            d = i + n * j + m * k
            a = i * j * t[d - n] + i * k * t[d - 1] + j * k * t[d - m]
            b = i * j + i * k + j * k
            t[d] = a / b if j or k else 1

print(t[r + n * s + m * p], t[s + n * p + m * r], t[p + n * r + m * s])