#include <bits/stdc++.h>
using namespace std;
double p[(205)][(205)][(205)];
double space(double first) { return first * (first - 1) / 2; }
int main() {
  int rr, ss, pp;
  cin >> rr >> ss >> pp;
  p[rr][ss][pp] = 1;
  for (int i = rr; i >= 0; i--) {
    for (int j = ss; j >= 0; j--) {
      for (int k = pp; k >= 0; k--) {
        double ppp2 = space(i) + space(j) + space(k);
        ppp2 /= space(i + j + k);
        if (i && k) {
          double ppp = p[i][j][k] / space(i + j + k) * i * k;
          p[i - 1][j][k] += ppp / (1 - ppp2);
        }
        if (j && k) {
          double ppp = p[i][j][k] / space(i + j + k) * j * k;
          p[i][j][k - 1] += ppp / (1 - ppp2);
        }
        if (i && j) {
          double ppp = p[i][j][k] / space(i + j + k) * i * j;
          p[i][j - 1][k] += ppp / (1 - ppp2);
        }
      }
    }
  }
  double ans[3];
  memset(ans, 0, sizeof(ans));
  for (int i = 1; i < (205); i++) ans[0] += p[i][0][0];
  for (int i = 1; i < (205); i++) ans[1] += p[0][i][0];
  for (int i = 1; i < (205); i++) ans[2] += p[0][0][i];
  for (int(i) = 0; (i) < (3); ++(i)) printf("%.9lf ", ans[i]);
  return 0;
}
