A,B,C,N=map(int,input().split())
DP=[[[[0]*(C+1) for i in range(B+1)] for j in range(A+1)] for k in range(N+1)]
DP[0][A][B][C]=1
for t in range(N):
  for i in range(1,A+1):
    for j in range(1,B+1):
      for k in range(1,C+1):
        DP[t+1][i][j][k]+=DP[t][i][j][k]*(i*j+j*k+i*k)*2/((i+j+k)*(i+j+k-1))
        if i>1:
          DP[t+1][i-1][j][k]+=DP[t][i][j][k]*i*(i-1)/((i+j+k)*(i+j+k-1))
        if j>1:
          DP[t+1][i][j-1][k]+=DP[t][i][j][k]*j*(j-1)/((i+j+k)*(i+j+k-1))
        if k>1:
          DP[t+1][i][j][k-1]+=DP[t][i][j][k]*k*(k-1)/((i+j+k)*(i+j+k-1))
ANS=[0,0,0]
for i in range(A+1):
  for j in range(B+1):
    for k in range(C+1):
      ANS[0]+=DP[N][i][j][k]*(A-i)
      ANS[1]+=DP[N][i][j][k]*(B-j)
      ANS[2]+=DP[N][i][j][k]*(C-k)
print(*ANS)