import sys
from operator import itemgetter
from collections import defaultdict, deque
import heapq
import bisect

stdin=sys.stdin
sys.setrecursionlimit(10 ** 8)

ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
Yp=lambda:print('Yes')
Np=lambda:print('No')
inf = 1 << 60
eps = 1e-9
sortkey = itemgetter(0)

class Comb():
    def __init__(self, N, mod):
        self.N = N
        self.mod = mod
        self.fa = self.fa_fainv()[0]
        self.fainv = self.fa_fainv()[1]

    def fa_fainv(self):
        fa = [1]
        for i in range(1, self.N + 1):
            fa.append(fa[-1] * i % self.mod)

        fainv = [pow(fa[-1],self.mod - 2,self.mod)]
        for i in range(1, self.N + 1)[::-1]:
            fainv.append(fainv[-1] * i % self.mod)
        fainv = fainv[::-1]

        return fa, fainv

    def calcu_comb(self, a, b):
        if b == 0:
            return 1
        return self.fa[a] * self.fainv[a - b] * self.fainv[b] % self.mod

###############################################################


A, B, C, N = lp()
dp = [[[[0 for _ in range(C + 1)] for _ in range(B + 1)] for _ in range(A + 1)] for _ in range(N + 1)]

dp[0][A][B][C] = 1
for i in range(N):
    for a in range(A + 1):
        for b in range(B + 1):
            for c in range(C + 1):
                if dp[i][a][b][c] == 0:
                    continue
                all_pos = 1
                if a > 1:
                    pos = (a * (a - 1) / 2) / ((a + b + c) * (a + b + c - 1) / 2)
                    all_pos -= pos
                    dp[i + 1][a - 1][b][c] += dp[i][a][b][c] * pos
                
                if b > 1:
                    pos = (b * (b - 1) / 2) / ((a + b + c) * (a + b + c - 1) / 2)
                    all_pos -= pos
                    dp[i + 1][a][b - 1][c] += dp[i][a][b][c] * pos

                if c > 1:
                    pos = (c * (c - 1) / 2) / ((a + b + c) * (a + b + c - 1) / 2)
                    all_pos -= pos
                    dp[i + 1][a][b][c - 1] += dp[i][a][b][c] * pos

                dp[i + 1][a][b][c] += dp[i][a][b][c] * all_pos

x = 0
y = 0
z = 0
for a in range(A + 1):
    for b in range(B + 1):
        for c in range(C + 1):
            x += dp[-1][a][b][c] * (A - a)
            y += dp[-1][a][b][c] * (B - b)
            z += dp[-1][a][b][c] * (C - c)


print(x, y, z)