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.
alpha = int(input("enter the number of alpha tribe: "))
beta = int( input("enter the number of beta tribe : "))
gamma =int(input("enter the number of gamma tribe : "))
total = alpha+beta+gamma

def factorial(x):
  fac = 1;
  for i in range(1,x+1):
    fac = fac*i
  return fac

def ncr(n, r):
    NCRfac = factorial(n) / (factorial(n - r) * factorial(r))
    return NCRfac

p1 = (ncr(alpha,2)+ncr(alpha,1)*ncr(beta,1))/ncr(total,2)
p2= (ncr(beta,2)+ncr(beta,1)*ncr(gamma,1))/ncr(total,2)
p3=(ncr(gamma,2)+ncr(gamma,1)*ncr(alpha,1))/ncr(total,2)
2
print(p1, p2, p3)