#include <bits/stdc++.h>
using namespace std;
int N, M, K;
long double dp[107][107][107];
int main() {
  scanf("%d%d%d", &N, &M, &K);
  dp[N][M][K] = 1;
  for (int n = N; n > 0; --n) {
    for (int m = M; m > 0; --m) {
      for (int k = K; k > 0; --k) {
        double second = n + m + k;
        double t = (0.0 + second) * (second - 1) / 2;
        double p = (n * (n - 1) + m * (m - 1) + k * (k - 1) + 0.0) / (2 * t);
        double q = n * m / t;
        double res = dp[n][m][k] / (1 - p);
        dp[n][m - 1][k] += res * q;
        q = n * k / t;
        dp[n - 1][m][k] += res * q;
        q = m * k / t;
        dp[n][m][k - 1] += res * q;
      }
    }
  }
  double ans1 = 0, ans2 = 0, ans3 = 0;
  for (int i = 0; i <= N; ++i) {
    for (int j = 0; j <= M; ++j)
      if (i + j > 0) {
        for (int k = 0; k <= K; ++k)
          if (i + k > 0 && j + k > 0) {
            if (i == 0) ans2 += dp[i][j][k];
            if (j == 0) ans3 += dp[i][j][k];
            if (k == 0) ans1 += dp[i][j][k];
          }
      }
  }
  printf("%.12lf %.12lf %.12lf", ans1, ans2, ans3);
  return 0;
}
