#include <bits/stdc++.h>
using namespace std;
int a, b, c;
double dp[102][102][102];
int main() {
  scanf("%d%d%d", &a, &b, &c);
  int n = max(max(a, b), c);
  dp[1][0][0] = 1;
  dp[1][1][0] = 1;
  for (int i = 1; i <= n; i++) dp[i][0][0] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= n; k++) {
        if (j && k) {
          double p = i * j + j * k + k * i;
          dp[i][j][k] = (dp[i][j - 1][k] * i * j + dp[i][j][k - 1] * j * k +
                         dp[i - 1][j][k] * k * i) /
                        p;
        }
        if (j && !k) dp[i][j][k] = 1;
        if (!j && k) dp[i][j][k] = 0;
        if (!j && !k) dp[i][j][k] = 1;
      }
  printf("%.12f %.12f %.12f", dp[a][b][c], dp[b][c][a], dp[c][a][b]);
  return 0;
}
