#import sys
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
import math
import bisect
import heapq
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e20)
mod = int(1e9+7)

u = [i*(i-1)//2 for i in range(151)]
a,b,c,n = mp()
dp = [[[0]*(c+1) for i in range(b+1)] for j in range(a+1)]
dp[a][b][c] = 1
for kai in range(n):
    cnt = [[[0]*(c+1) for i in range(b+1)] for j in range(a+1)]
    for i in range(a+1):
        for j in range(b+1):
            for k in range(c+1):
                if dp[i][j][k] == 0:continue
                num = i+j+k
                num_prob = 1
                if i != 1:
                    prob = u[i]/u[num]
                    cnt[i-1][j][k] += dp[i][j][k]*prob
                    num_prob -= prob
                if j != 1:
                    prob = u[j]/u[num]
                    cnt[i][j-1][k] += dp[i][j][k]*prob
                    num_prob -= prob
                if k != 1:
                    prob = u[k]/u[num]
                    cnt[i][j][k-1] += dp[i][j][k]*prob
                    num_prob -= prob
                cnt[i][j][k] += dp[i][j][k]*num_prob
    dp = cnt
#print(dp)
ans = [0,0,0]
for i in range(a+1):
    for j in range(b+1):
        for k in range(c+1):
            if dp[i][j][k] == 0:continue
            ans[0] += dp[i][j][k]*(a-i)
            ans[1] += dp[i][j][k]*(b-j)
            ans[2] += dp[i][j][k]*(c-k)
print(*ans)