A,B,C,N = map(int,input().split())
dp = [[[0]*51 for _ in range(51)] for _ in range(51)]
dp[A][B][C] = 1

def precomb(N):
    pascal = [0]*(N+1)
    pascal[0] = [1]
    pascal[1] = [1,1]
    for i in range(2,N+1):
        res = [0]*(i+1)
        res[0] = res[-1] = 1
        for j in range(len(pascal[i-1])-1):
            res[j+1] = (pascal[i-1][j]+pascal[i-1][j+1])
        pascal[i] = res[:]
    return pascal

pascal = precomb(200)

for _ in range(N):
    ndp = [[[0]*51 for _ in range(51)] for _ in range(51)]
    for a in range(A+1):
        for b in range(B+1):
            for c in range(C+1):
                s = a+b+c
                if s < 2:
                    continue
                div = pascal[s][2]
                tdp = dp[a][b][c]
                t = 0
                if a >= 2:
                    u = pascal[a][2]
                    t += u
                    ndp[a-1][b][c] += tdp*u/div
                if b >= 2:
                    u = pascal[b][2]
                    t += u
                    ndp[a][b-1][c] += tdp*u/div
                if c >= 2:
                    u = pascal[c][2]
                    t += u
                    ndp[a][b][c-1] += tdp*u/div
                ndp[a][b][c] += tdp*(div-t)/div
    dp = ndp

ans_a = 0
ans_b = 0
ans_c = 0
for a in range(A+1):
    for b in range(B+1):
        for c in range(C+1):
            tdp = dp[a][b][c]
            ans_a += (A-a)*tdp
            ans_b += (B-b)*tdp
            ans_c += (C-c)*tdp
print(ans_a,ans_b,ans_c)