#include <bits/stdc++.h>
using namespace std;
double R[101][101][101];
int main() {
  int r, s, p, i, j, k;
  scanf("%d%d%d", &r, &s, &p);
  for (i = 0; i <= r; i++) {
    for (j = 0; j <= s; j++) {
      for (k = 0; k <= p; k++) {
        R[i][j][k] = -1.00;
      }
    }
  }
  R[0][0][0] = 0;
  int mx = max(max(r, p), s);
  for (i = 0; i <= mx; i++) {
    for (j = 0; j <= mx; j++) {
      for (k = 0; k <= mx; k++) {
        int sum = (r + s + p);
        int tot = ((sum) * (sum - 1)) / 2;
        if (i == 0) {
          R[i][j][k] = 0;
          continue;
        }
        if (j + k == 0) {
          R[i][j][k] = 1;
          continue;
        }
        R[i][j][k] = 0;
        if (i != 0 && j != 0) R[i][j][k] += (R[i][j - 1][k] * i * j) / tot;
        if (j != 0 && k != 0) R[i][j][k] += (R[i][j][k - 1] * j * k) / tot;
        if (k != 0 && i != 0) R[i][j][k] += (R[i - 1][j][k] * k * i) / tot;
        R[i][j][k] = (R[i][j][k] * tot) / (i * j + j * k + k * i);
      }
    }
  }
  printf("%.11lf %.11lf %.11lf\n", R[r][s][p], R[s][p][r], R[p][r][s]);
  return 0;
}
