#include <bits/stdc++.h>
using namespace std;
double dp[105][105][105];
void solve(int r, int s, int p) {
  double _r = 0, _s = 0, _p = 0;
  for (int i = r; i >= 0; i--) {
    for (int j = s; j >= 0; j--) {
      for (int k = p; k >= 0; k--) {
        double tot = i * j + j * k + k * i;
        if ((i == 0) && (j == 0) && (k > 0)) _p += dp[i][j][k];
        if ((k == 0) && (j == 0) && (i > 0)) _r += dp[i][j][k];
        if ((i == 0) && (k == 0) && (s > 0)) _s += dp[i][j][k];
        if (tot == 0) continue;
        if (i > 0) {
          double t = i * k;
          dp[i - 1][j][k] += (dp[i][j][k] * t / tot);
        }
        if (j > 0) {
          double t = j * i;
          dp[i][j - 1][k] += (dp[i][j][k] * t / tot);
        }
        if (k > 0) {
          double t = j * k;
          dp[i][j][k - 1] += (dp[i][j][k] * t / tot);
        }
      }
    }
  }
  printf("%0.9f %0.9f %0.9f\n", _r, _s, _p);
}
int main() {
  int r, s, p;
  cin >> r >> s >> p;
  dp[r][s][p] = 1;
  solve(r, s, p);
  return 0;
}
