#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """4 3 2 13

# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10


A, B, C, N = map(int, input().split())
dp = [[[[0.0] * (C+1) for _ in range(B+1)] for _ in range(A+1)] for _ in range(N+1)]
dp[0][A][B][C] = 1.0
for i in range(N):
    for a in range(A+1):
        for b in range(B+1):
            for c in range(C+1):
                n = a+b+c
                if n <= 1:
                    continue
                dp[i+1][a][b][c] += dp[i][a][b][c] * (a*(b+c) + b*(a+c) + c*(a+b)) / (n*(n-1))
                if a >= 2:
                    dp[i+1][a-1][b][c] += dp[i][a][b][c] * (a*(a-1))/(n*(n-1))
                if b >= 2:
                    dp[i+1][a][b-1][c] += dp[i][a][b][c] * (b*(b-1))/(n*(n-1))
                if c >= 2:
                    dp[i+1][a][b][c-1] += dp[i][a][b][c] * (c*(c-1))/(n*(n-1))

ans_a, ans_b, ans_c = 0.0, 0.0, 0.0
for a in range(A+1):
    for b in range(B+1):
        for c in range(C+1):
            ans_a += (A-a) * dp[N][a][b][c]
            ans_b += (B-b) * dp[N][a][b][c]
            ans_c += (C-c) * dp[N][a][b][c]
print(ans_a, ans_b, ans_c)