#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
inline void RI(int &x) {
  char c;
  while ((c = getchar()) < '0' || c > '9')
    ;
  x = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0';
}
inline void Out(int a) {
  if (a > 9) Out(a / 10);
  putchar(a % 10 + '0');
}
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
const double dnf = 1e18;
const double eps = 1e-12;
const long long mod = 1000000007;
const int maxn = 110;
const int maxk = 110;
double dp[maxn][maxn][maxn];
double solve(int r, int s, int p) {
  for (int i = 1; i <= r; i++)
    for (int j = 1; j <= s; j++) {
      dp[i][j][0] = 1;
      for (int k = 1; k <= p; k++) {
        double mu = i * j + j * k + k * i;
        dp[i][j][k] =
            (i * j / mu * dp[i][j - 1][k] + j * k / mu * dp[i][j][k - 1] +
             k * i / mu * dp[i - 1][j][k]);
      }
    }
  return dp[r][s][p];
}
int r, s, p;
int main() {
  while (cin >> r >> s >> p) {
    printf("%.12f ", solve(r, s, p));
    printf("%.12f ", solve(s, p, r));
    printf("%.12f\n", solve(p, r, s));
  }
}
