import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

from functools import lru_cache

a, b, c, n = LI()

@lru_cache(None)
def ev(i, j, k, t):
    if t == 0: return 0, 0, 0
    s = i+j+k
    if s < 2: return 0, 0, 0
    ni = nj = nk = 0
    sp = 0
    if i > 1:
        p = i*(i-1)/s/(s-1)
        sp += p
        ri, rj, rk = ev(i-1, j, k, t-1)
        ni += (ri+1)*p
        nj += rj*p
        nk += rk*p
    if j > 1:
        p = j*(j-1)/s/(s-1)
        sp += p
        ri, rj, rk = ev(i, j-1, k, t-1)
        ni += ri*p
        nj += (rj+1)*p
        nk += rk*p
    if k > 1:
        p = k*(k-1)/s/(s-1)
        sp += p
        ri, rj, rk = ev(i, j, k-1, t-1)
        ni += ri*p
        nj += rj*p
        nk += (rk+1)*p
    p = 1-sp
    ri, rj, rk = ev(i, j, k, t-1)
    ni += ri*p
    nj += rj*p
    nk += rk*p
    return ni, nj, nk

print(*ev(a, b, c, n))