#include #include using namespace std; using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; using ll = long long; using ld = long double; using pll = pair; using tlll = tuple; constexpr ll INF = 1LL << 60; template bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll safemod(ll A, ll M) {return (A % M + M) % M;} ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;} ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) int main() { ll A, B, C, N; cin >> A >> B >> C >> N; vector dp(N + 1, vector(A + 2, vector(B + 2, vector(C + 2, 0.0L)))); dp.at(0).at(0).at(0).at(0) = 1.0L; for (ll i = 0; i < N; i++) { for (ll a = 0; a <= A; a++) { for (ll b = 0; b <= B; b++) { for (ll c = 0; c <= C; c++) { ld all = (A - a) + (B - b) + (C - c); if (all <= 1) continue; ld pa = (A - a) * (A - a - 1) / (all * (all - 1)); ld pb = (B - b) * (B - b - 1) / (all * (all - 1)); ld pc = (C - c) * (C - c - 1) / (all * (all - 1)); ld pd = 1 - (pa + pb + pc); dp.at(i + 1).at(a + 1).at(b).at(c) += pa * dp.at(i).at(a).at(b).at(c); dp.at(i + 1).at(a).at(b + 1).at(c) += pb * dp.at(i).at(a).at(b).at(c); dp.at(i + 1).at(a).at(b).at(c + 1) += pc * dp.at(i).at(a).at(b).at(c); dp.at(i + 1).at(a).at(b).at(c) += pd * dp.at(i).at(a).at(b).at(c); } } } } ld ansa = 0, ansb = 0, ansc = 0; for (ll a = 0; a <= A; a++) { for (ll b = 0; b <= B; b++) { for (ll c = 0; c <= C; c++) { ld p = dp.at(N).at(a).at(b).at(c); ansa += p * a; ansb += p * b; ansc += p * c; //cerr << a << " " << b << " " << c << " " << p << endl; } } } cout << fixed << setprecision(15) << ansa << " " << ansb << " " << ansc << endl; }