#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int A, B, C, N;
double ans[51][51][51][51];

double solve(int A, int B, int C, int N) {
    if (ans[A][B][C][N] != -1) return ans[A][B][C][N];
    double ret = 0;
    if (A > 1) ret += 1.0 * A * (A - 1) / (A + B + C) / (A + B + C - 1) * (1 + solve(A - 1, B, C, N - 1));
    if (B > 1) ret += 1.0 * B * (B - 1) / (A + B + C) / (A + B + C - 1) * (0 + solve(A, B - 1, C, N - 1));
    if (C > 1) ret += 1.0 * C * (C - 1) / (A + B + C) / (A + B + C - 1) * (0 + solve(A, B, C - 1, N - 1));
    ret += (1.0 - 1.0 * (A * (A - 1) + B * (B - 1) + C * (C - 1)) / (A + B + C) / (A + B + C - 1)) * solve(A, B, C, N - 1);
    ans[A][B][C][N] = ret;
    return ret;
}

int main() {
    rep(i, 0, 51) rep(j, 0, 51) rep(k, 0, 51) {
        ans[i][j][k][0] = 0;
        rep(l, 1, 51) ans[i][j][k][l] = -1;
    }
    cin >> A >> B >> C >> N;
    cout << fixed <<  setprecision(16) << solve(A, B, C, N) << " ";
    cout << fixed <<  setprecision(16) << solve(B, A, C, N) << " ";
    cout << fixed <<  setprecision(16) << solve(C, B, A, N) << "\n";
}