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
# a,b,c枚あるとき、全パターン(a+b+c)C2,a2枚はaC2,b2枚はbC2,c2枚はcC2

for i in range(N):
    for j in range(1,A+1):
        for k in range(1,B+1):
            for l in range(1,C+1):
                if dp[j][k][l]==0:
                    continue
                alln = (j+k+l)*(j+k+l-1)//2
                dp[j-1][k][l] += dp[j][k][l]*(j)*(j-1)/2/alln
                dp[j][k-1][l] += dp[j][k][l]*(k)*(k-1)/2/alln
                dp[j][k][l-1] += dp[j][k][l]*(l)*(l-1)/2/alln
                dp[j][k][l] -= dp[j][k][l]*((j)*(j-1)/2/alln+(k)*(k-1)/2/alln+(l)*(l-1)/2/alln)

Av = 0
Bv = 0
Cv = 0


for j in range(1,A+1):
    for k in range(1,B+1):
        for l in range(1,C+1):
            Av += (A-j)*dp[j][k][l]
            Bv += (B-k)*dp[j][k][l]
            Cv += (C-l)*dp[j][k][l]

print(*[Av,Bv,Cv])