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.
from decimal import Decimal
from typing import List
from functools import cache

@cache
def compute_probs(r: int, s: int, p: int) -> List[int]:
    if r == 0:
        return [0, 1, 0]
    if s == 0:
        return [0, 0, 1]
    if p == 0:
        return [1, 0, 0]

    total = r*s + r*p + s*p

    res1 = [Decimal(r*s/total) * elem for elem in compute_probs(r, s - 1, p)]
    res2 = [Decimal(r*p/total) * elem for elem in compute_probs(r - 1, s, p)]
    res3 = [Decimal(s*p/total) * elem for elem in compute_probs(r, s, p - 1)]

    ans = [x + y + z for x, y, z in zip(res1, res2, res3)]

    return ans

    

r, s, p = [int(x) for x in input().split()]
x, y, z = compute_probs(r, s, p)
print(f"{str(x)} {str(y)} {str(z)}")