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 i in range(s+1)] for j in range(r+1)]
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]:
            x=i*j+j*k+k*i
            if i>0 and j>0:
                dp[i][j-1][k]+=i*j*dp[i][j][k]/x
            if j>0 and k>0:
                dp[i][j][k-1]+=j*k*dp[i][j][k]/x
            if k>0 and i>0:
                dp[i-1][j][k]+=i*k*dp[i][j][k]/x
a1,a2,a3=0,0,0
for i in range(1,r+1):
    a1+=dp[i][0][0]
for i in range(1,s+1):
    a2+=dp[0][i][0]
for i in range(1,p+1):
    a3+=dp[0][0][i]
print(a1,a2,a3)