#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

//constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-8;

//int N, M, K, T, H, W, L, R;
long long int N, M, K, T, H, W, L, R;

long double dp[51][51][51] = {};
long double ndp[51][51][51] = {};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int a, b, c;
	cin >> a >> b >> c >> N;
	dp[a][b][c] = 1;
	while (N--) {
		for (int i = 1; i <= a; i++) {
			for (int j = 1; j <= b; j++) {
				for (int k = 1; k <= c; k++) {
					long double num = i + j + k;
					long double amari = 1;
					{
						long double p = i * (i - 1);
						p /= num;
						p /= num - 1;
						ndp[i - 1][j][k] += dp[i][j][k] * p;
						amari -= p;
					}
					{
						long double p = j * (j - 1);
						p /= num;
						p /= num - 1;
						ndp[i][j - 1][k] += dp[i][j][k] * p;
						amari -= p;
					}
					{
						long double p = k * (k - 1);
						p /= num;
						p /= num - 1;
						ndp[i][j][k - 1] += dp[i][j][k] * p;
						amari -= p;
					}
					ndp[i][j][k] = dp[i][j][k] * amari;
				}
			}
		}
		for (int i = 1; i <= a; i++) {
			for (int j = 1; j <= b; j++) {
				for (int k = 1; k <= c; k++) {
					dp[i][j][k] = ndp[i][j][k];
					ndp[i][j][k] = 0;
				}
			}
		}
	}
	long double d = 0, e = 0, f = 0;
	for (int i = 1; i <= a; i++) {
		for (int j = 1; j <= b; j++) {
			for (int k = 1; k <= c; k++) {
				d += dp[i][j][k] * (a - i);
				e += dp[i][j][k] * (b - j);
				f += dp[i][j][k] * (c - k);
			}
		}
	}
	cout << fixed << setprecision(20) << d << " " << e << " " << f << endl;
}