#include <bits/stdc++.h>
using namespace std;
long double dp[105][105][105] = {0};
int main() {
  int R, S, P;
  cin >> R >> S >> P;
  dp[R][S][P] = 1;
  for (int sum = R + S + P; sum > 0; sum--) {
    for (int r = R; r >= 0; r--) {
      for (int s = S; s >= 0; s--) {
        int p = sum - r - s;
        if (p < 0 || p > P) continue;
        if (r == 0 && s == 0) continue;
        if (r == 0 && p == 0) continue;
        if (s == 0 && p == 0) continue;
        long double cur = dp[r][s][p];
        int waysR = r * s;
        int waysS = s * p;
        int waysP = p * r;
        int totalWays = waysP + waysR + waysS;
        if (r > 0) dp[r - 1][s][p] += cur * waysP / totalWays;
        if (s > 0) dp[r][s - 1][p] += cur * waysR / totalWays;
        if (p > 0) dp[r][s][p - 1] += cur * waysS / totalWays;
      }
    }
  }
  long double ansR = 0;
  long double ansS = 0;
  long double ansP = 0;
  for (int r = 1; r <= R; r++) ansR += dp[r][0][0];
  for (int s = 1; s <= S; s++) ansS += dp[0][s][0];
  for (int p = 1; p <= P; p++) ansP += dp[0][0][p];
  printf("%.12f %.12f %.12f\n", (double)ansR, (double)ansS, (double)ansP);
}
