import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

immutable long MOD = 10^^9 + 7;

void main() {
    auto s = readln.split.map!(to!int);
    auto A = s[0];
    auto B = s[1];
    auto C = s[2];
    auto N = s[3];

    auto dp = new real[][][][](N+1, A+1, B+1, C+1);
    foreach (i; 0..N+1) foreach (a; 0..A+1) foreach (b; 0..B+1) dp[i][a][b][] = 0;
    dp[0][0][0][0] = 1;

    foreach (i; 0..N) foreach (a; 0..A+1) foreach (b; 0..B+1) foreach (c; 0..C+1) {
        auto p = dp[i][a][b][c];
        auto sm = A + B + C - (a + b + c);
        real hoge = 1;
        if (p == 0) continue;
        if (A - a >= 2) {
            auto x = 1.0L * (A - a) / sm * (A - a - 1) / (sm - 1);
            dp[i+1][a+1][b][c] += p * x;
            hoge -= x;
        }
        if (B - b >= 2) {
            auto x = 1.0L * (B - b) / sm * (B - b - 1) / (sm - 1);
            dp[i+1][a][b+1][c] += p * x;
            hoge -= x;
        }
        if (C - c >= 2) {
            auto x = 1.0L * (C - c) / sm * (C - c - 1) / (sm - 1);
            dp[i+1][a][b][c+1] += p * x;
            hoge -= x;
        }
        dp[i+1][a][b][c] += p * hoge;
    }

    real ans_a = 0;
    real ans_b = 0;
    real ans_c = 0;

    foreach (a; 0..A+1) foreach (b; 0..B+1) foreach (c; 0..C+1) {
        auto p = dp[N][a][b][c];
        ans_a += a * p;
        ans_b += b * p;
        ans_c += c * p;
    }

    writeln(format("%.15f %.15f %.15f", ans_a, ans_b, ans_c));
}