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
import os
from io import BytesIO, IOBase

# region fastio
BUFSIZE = 8192
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")

if sys.version_info[0] < 3:
    sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

f = sys.stdin
if os.environ.get('USER') == "loic":
    f = open("data.in")
    
line = lambda: f.readline().split()
ui = lambda: int(line()[0])
ti = lambda: map(int,line())
li = lambda: list(ti())

#######################################################################

def solve():
    
    dp = [[[[0,0,0] for _ in range(P+1)] for _ in range(S+1)] for _ in range(R+1)]
    for i in range(R+1):
        dp[i][0][0][0] = 1
    for j in range(S+1):
        dp[0][j][0][1] = 1
    for k in range(P+1):
        dp[0][0][k][2] = 1
#     for i in range(R+1):
#         for j in range(S+1):
#             dp[i][j][0][0] = 1
#     for i in range(R+1):
#         for k in range(P+1):
#             dp[i][0][k][2] = 1
#     for j in range(S+1):
#         for k in range(P+1):
#             dp[0][j][k][1] = 1
    
    
    for i in range(R+1):
        for j in range(S+1):
            for k in range(P+1):
                rs = i*j
                rp = i*k
                sp = j*k
                s = rs + rp + sp
                if s == 0:
                    continue
                
                if rs > 0:
                    for p in range(3):
                        dp[i][j][k][p] += rs * dp[i][j-1][k][p]
                if rp > 0:
                    for p in range(3):
                        dp[i][j][k][p] += rp * dp[i-1][j][k][p]
                if sp > 0:
                    for p in range(3):
                        dp[i][j][k][p] += sp * dp[i][j][k-1][p]
                
                for p in range(3):
                    dp[i][j][k][p] = dp[i][j][k][p] / s
    
    res = " ".join(str(v) for v in dp[R][S][P])
    
    return str(res)

for test in range(1,1+1):
    R,S,P = ti()
    
    print(solve())
    
f.close()