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.

memo = [[[None for i in range(101)] for j in range(101)] for k in range(101)] 

def comp(aa,bb,cc):
    total = aa + bb + cc
    total = total * (total - 1) / 2
    return (aa*cc)/total,(bb*aa)/total,(bb*cc)/total

def dp(aa,bb,cc):
    if memo[aa][bb][cc] is not None:
        return memo[aa][bb][cc]
    if not aa and bb:
        return 0,1,0
    if not bb and cc:
        return 0,0,1
    if not cc and aa:
        return 1,0,0
    aaa,bbb,ccc = comp(aa, bb, cc)
    rep = (aaa+bbb+ccc)
    ta = tuple(x * aaa for x in dp(aa-1,bb,cc))
    tb = tuple(x * bbb for x in dp(aa,bb-1,cc))
    tc = tuple(x * ccc for x in dp(aa,bb,cc-1))
    memo[aa][bb][cc] = tuple(map(sum, zip(ta,tb,tc)))
    memo[aa][bb][cc] = tuple(x/rep for x in memo[aa][bb][cc])
    return memo[aa][bb][cc]


a,b,c = map(int, input().split(" "))
a,b,c = dp(a,b,c)
print(a,b,c)
