A,B,C,n = map(int,input().split())
dp = [[[0]*(C+1) for i in range(B+1)] for j in range(A+1)]
dp[A][B][C] = 1
for i in range(n):
    ndp = [[[0]*(C+1) for i in range(B+1)] for j in range(A+1)]
    for a in range(A+1):
        for b in range(B+1):
            for c in range(C+1):
                if dp[a][b][c] == 0:
                    continue
                prob = dp[a][b][c]

                if a > 1:
                    ndp[a-1][b][c] += prob*a*(a-1)/(a+b+c)/(a+b+c-1)
                    ndp[a][b][c] -= prob*a*(a-1)/(a+b+c)/(a+b+c-1)

                if b > 1:
                    ndp[a][b-1][c] += prob*b*(b-1)/(a+b+c)/(a+b+c-1)
                    ndp[a][b][c] -= prob*b*(b-1)/(a+b+c)/(a+b+c-1)

                if c > 1:
                    ndp[a][b][c-1] += prob*c*(c-1)/(a+b+c)/(a+b+c-1)
                    ndp[a][b][c] -= prob*c*(c-1)/(a+b+c)/(a+b+c-1)
                ndp[a][b][c] += prob
    dp = ndp
a = 0
b = 0
c = 0
for i in range(A+1):
    for j in range(B+1):
        for k in range(C+1):
            prob = dp[i][j][k]
            a += (A-i)*prob
            b += (B-j)*prob
            c += (C-k)*prob
print(a,b,c)