import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }
double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto A = RD;
	auto B = RD;
	auto C = RD;
	auto N = RD;

	auto dp = new double[][][](A+1, B+1, C+1);
	foreach (i; 0..A+1)
		foreach (j; 0..B+1)
			dp[i][j][] = 0.0;
	dp[A][B][C] = 1.0;
	foreach (i; 0..N)
	{
		auto ndp = new double[][][](A+1, B+1, C+1);
		foreach (j; 0..A+1)
			foreach (k; 0..B+1)
				ndp[j][k][] = 0.0;
		foreach (a; 0..A+1)
		{
			foreach (b; 0..B+1)
			{
				foreach (c; 0..C+1)
				{
					if (dp[a][b][c] == 0.0) continue;
					double cnt = a + b + c;
					if (cnt < 2)
					{
						ndp[a][b][c] += dp[a][b][c];
						continue;
					}
					auto pa = (a / cnt) * ((a-1) / (cnt-1));
					auto pb = (b / cnt) * ((b-1) / (cnt-1));
					auto pc = (c / cnt) * ((c-1) / (cnt-1));
					ndp[a-1][b][c] += dp[a][b][c] * pa;
					ndp[a][b-1][c] += dp[a][b][c] * pb;
					ndp[a][b][c-1] += dp[a][b][c] * pc;
					ndp[a][b][c] += dp[a][b][c] * (1.0 - pa - pb - pc);
				}
			}
		}
		dp = ndp;
	}

	double ans_a = 0.0, ans_b = 0.0, ans_c = 0.0;
	foreach (a; 0..A+1)
	{
		foreach (b; 0..B+1)
		{
			foreach (c; 0..C+1)
			{
				ans_a += dp[a][b][c] * (A - a);
				ans_b += dp[a][b][c] * (B - b);
				ans_c += dp[a][b][c] * (C - c);
			}
		}
	}

	writefln(FMT_F ~ " " ~ FMT_F ~ " " ~ FMT_F, ans_a, ans_b, ans_c);
	stdout.flush;
	debug readln;
}