#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

template < class T >
vector< vector< T > > bicoef_table(int N) {
    vector< vector< T > > table(N + 1, vector< T >(N + 1));
    table[0][0] = 1;
    for(int i = 1; i <= N; i++) {
        table[i][0] = 1;
        for(int j = 1; j <= N; j++) {
            table[i][j] = table[i - 1][j - 1] + table[i - 1][j];
        }
    }
    return table;
}

using ld = long double;
ld dp[51][51][51][51] = {0.0};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int A,B,C,N; cin >> A >> B >> C >> N;
    dp[A][B][C][0] = 1.0;

    auto bt = bicoef_table<ld>(200);
    auto comb = [bt](int N, int K) {
        if(N < K) return ld(0.0);
        return bt[N][K];
    };

    for(int n = 0; n < N; n++)
        for(int a = A; a >= 0; a--)
            for(int b = B; b >= 0; b--)
                for(int c = C; c >= 0; c--) if(a + b + c > 1) {
                    if(a) dp[a - 1][b][c][n + 1] += dp[a][b][c][n] * comb(a, 2) / comb(a + b + c, 2);
                    if(b) dp[a][b - 1][c][n + 1] += dp[a][b][c][n] * comb(b, 2) / comb(a + b + c, 2);
                    if(c) dp[a][b][c - 1][n + 1] += dp[a][b][c][n] * comb(c, 2) / comb(a + b + c, 2);
                    dp[a][b][c][n + 1] += dp[a][b][c][n] * (1.0 - (comb(a, 2) + comb(b, 2) + comb(c, 2)) / comb(a + b + c, 2));
                }

    ld EA = 0, EB = 0, EC = 0;
    rep(a,A+1)rep(b,B+1)rep(c,C+1) {
        EA += (A - a) * dp[a][b][c][N];
        EB += (B - b) * dp[a][b][c][N];
        EC += (C - c) * dp[a][b][c][N];
    }
    cout << fixed << setprecision(20) << EA << " " << EB << " " << EC << endl;
}