#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long power(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
long long add(long long a, long long b, long long mod = MOD) {
  return (a + b) % mod;
}
long long sub(long long a, long long b, long long mod = MOD) {
  return ((a - b) % mod + mod) % mod;
}
long long mul(long long a, long long b, long long mod = MOD) {
  return (a * b) % mod;
}
long long divide(long long a, long long b, long long mod = MOD) {
  return (a * power(b, mod - 2, mod)) % mod;
}
long long sqrt_floor(long long x) {
  long long y = sqrt(x);
  while (y * y > x) --y;
  while ((y + 1) * (y + 1) <= x) ++y;
  return y;
}
long double dp[105][105][105];
int R, S, P;
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(0);
  cin >> R >> S >> P;
  dp[R][S][P] = 1;
  for (int r = R; r >= 0; --r) {
    for (int s = S; s >= 0; --s) {
      for (int p = P; p >= 0; --p) {
        long double denom = r * s + s * p + p * r;
        if (r and s) dp[r][s - 1][p] += dp[r][s][p] * (r * s) / denom;
        if (s and p) dp[r][s][p - 1] += dp[r][s][p] * (s * p) / denom;
        if (r and p) dp[r - 1][s][p] += dp[r][s][p] * (p * r) / denom;
      }
    }
  }
  long double left = 0;
  long double beech = 0;
  long double right = 0;
  for (int i = 1; i <= R; ++i) {
    left += dp[i][0][0];
  }
  for (int i = 1; i <= S; ++i) {
    beech += dp[0][i][0];
  }
  for (int i = 1; i <= P; ++i) {
    right += dp[0][0][i];
  }
  cout << setprecision(12) << fixed;
  cout << left << " " << beech << " " << right;
  return 0;
}
