import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum L = 52;

void main() {
  auto dp = new real[][][][](L + 1, L + 1, L + 1, L + 1);
  foreach (n; 0 .. L + 1) {
    foreach (a; 1 .. L + 1) foreach (b; 1 .. L + 1) foreach (c; 1 .. L + 1) {
      if (n == 0) {
        dp[n][a][b][c] = 0.0L;
      } else {
        real denom = (a + b + c) * (a + b + c - 1) / 2.0L;
        real t = 0.0L;
        if (a >= 2) t += (a * (a - 1) / 2.0L) / denom * (1 + dp[n - 1][a - 1][b][c]);
        if (b >= 2) t += (b * (b - 1) / 2.0L) / denom * (0 + dp[n - 1][a][b - 1][c]);
        if (c >= 2) t += (c * (c - 1) / 2.0L) / denom * (0 + dp[n - 1][a][b][c - 1]);
        t += (a * b + b * c + c * a) / denom * (0 + dp[n - 1][a][b][c]);
        dp[n][a][b][c] = t;
      }
    }
  }
  
  try {
    for (; ; ) {
      const A = readInt();
      const B = readInt();
      const C = readInt();
      const N = readInt();
      
      writefln("%.12f %.12f %.12f", dp[N][A][B][C], dp[N][B][C][A], dp[N][C][A][B]);
    }
  } catch (EOFException e) {
  }
}