from functools import lru_cache

@lru_cache(None)
def dfs(a, b, c, n):
    tot = a + b + c
    if n == 0 or tot <= 1:
        return 0, 0, 0
    ret = [0, 0, 0]
    
    div = tot * (tot - 1) // 2
    dif = div
    if a >= 2:
        aa = a * (a - 1) // 2
        dif -= aa
        tmp = dfs(a - 1, b, c, n - 1)
        ret[0] += aa / div
        for i in range(3):
            ret[i] += tmp[i] * aa / div
    if b >= 2:
        bb = b * (b - 1) // 2
        dif -= bb
        tmp = dfs(a, b - 1, c, n - 1)
        ret[1] += bb / div
        for i in range(3):
            ret[i] += tmp[i] * bb / div
    if c >= 2:
        cc = c * (c - 1) // 2
        dif -= cc
        tmp = dfs(a, b, c - 1, n - 1)
        ret[2] += cc / div
        for i in range(3):
            ret[i] += tmp[i] * cc / div
    tmp = dfs(a, b, c, n - 1)
    for i in range(3):
        ret[i] += tmp[i] * dif / div
    return ret
    

a, b, c, n = map(int, input().split())    
print(*dfs(a, b, c, n))