#include <bits/stdc++.h>
using namespace std;
const int SIZE = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const double PI = atan(1.0) * 4.0;
const long long mod = 1e9 + 7;
int r, s, p;
double dp[105][105][105];
int main() {
  scanf("%d%d%d", &r, &s, &p);
  dp[r][s][p] = 1;
  for (int i = r; i >= 0; i--)
    for (int j = s; j >= 0; j--)
      for (int k = p; k >= 0; k--) {
        int res = i * j + j * k + k * i;
        if (res == 0) continue;
        if (i) dp[i - 1][j][k] += dp[i][j][k] * i * k / res;
        if (j) dp[i][j - 1][k] += dp[i][j][k] * j * i / res;
        if (k) dp[i][j][k - 1] += dp[i][j][k] * k * j / res;
      }
  double ans = 0;
  for (int i = 1; i <= r; i++) ans += dp[i][0][0];
  printf("%.12lf", ans);
  ans = 0;
  for (int i = 1; i <= s; i++) ans += dp[0][i][0];
  printf(" %.12lf", ans);
  ans = 0;
  for (int i = 1; i <= p; i++) ans += dp[0][0][i];
  printf(" %.12lf", ans);
  return 0;
}
