#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
const int iinf = 1 << 29;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long mrand(long long B) { return (unsigned long long)rng() % B; }
long long cross(pair<long long, long long> p1, pair<long long, long long> p2) {
  return p1.first * p2.second - p2.first * p1.second;
}
bool online(pair<long long, long long> a, pair<long long, long long> b,
            pair<long long, long long> c) {
  pair<long long, long long> p1{b.first - a.first, b.second - a.second};
  pair<long long, long long> p2{c.first - a.first, c.second - a.second};
  return cross(p1, p2) == 0;
}
void z_func(vector<int> &z, vector<int> &s, int n) {
  int L = 0, R = 0;
  for (int i = 1; i < n; i++) {
    if (i > R) {
      L = R = i;
      while (R < n && s[R - L] == s[R]) R++;
      z[i] = R - L;
      R--;
    } else {
      int k = i - L;
      if (z[k] < R - i + 1)
        z[i] = z[k];
      else {
        L = i;
        while (R < n && s[R - L] == s[R]) R++;
        z[i] = R - L;
        R--;
      }
    }
  }
}
const int MXN = 101;
int R, S, P;
long double pr[MXN][MXN][MXN], ps[MXN][MXN][MXN], pp[MXN][MXN][MXN];
void work() {
  cin >> R >> S >> P;
  for (int i = 1; i < MXN; ++i) {
    for (int j = 0; j < MXN; ++j) {
      pr[i][j][0] = 1.0;
      ps[0][i][j] = 1.0;
      pp[j][0][i] = 1.0;
    }
  }
  for (int i = 1; i <= R; ++i) {
    for (int j = 1; j <= S; ++j) {
      for (int k = 1; k <= P; ++k) {
        long double tot = (i * j + i * k + j * k);
        pr[i][j][k] += ((long double)(i * j) / tot) * pr[i][j - 1][k];
        pr[i][j][k] += ((long double)(i * k) / tot) * pr[i - 1][j][k];
        pr[i][j][k] += ((long double)(k * j) / tot) * pr[i][j][k - 1];
        ps[i][j][k] += ((long double)(i * j) / tot) * ps[i][j - 1][k];
        ps[i][j][k] += ((long double)(i * k) / tot) * ps[i - 1][j][k];
        ps[i][j][k] += ((long double)(k * j) / tot) * ps[i][j][k - 1];
        pp[i][j][k] += ((long double)(i * j) / tot) * pp[i][j - 1][k];
        pp[i][j][k] += ((long double)(i * k) / tot) * pp[i - 1][j][k];
        pp[i][j][k] += ((long double)(k * j) / tot) * pp[i][j][k - 1];
      }
    }
  }
  cout << setprecision(17) << pr[R][S][P] << " " << ps[R][S][P] << " "
       << pp[R][S][P] << endl;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  work();
  return 0;
}
