#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
// Ref: https://qiita.com/ysuzuki19/items/d89057d65284ba1a16ac
#define dump(var)  do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cerr << e << "\n";}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cerr << e << " "; } std::cerr << "\n";}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ std::cerr << "\n"; for(const auto& v : vv){ view(v); } }
template<typename T> void dump_cout(const T& v) { for(long long i = 0; i < v.size(); i++) std::cout << v[i] << (i == v.size()-1 ? "\n" : " "); }

#define N 55
double dp[N][N][N][N];

void solve() {
    ll a, b, c, n;
    cin >> a >> b >> c >> n;
    dp[0][a][b][c] = 1.0;
    rep(i, 0, n) {
        rep(x, 0, a+1) {
            rep(y, 0, b+1) {
                rep(z, 0, c+1) {
                    ll sum = x + y + z;
                    if(sum <= 1) continue;
                    if(x >= 2) dp[i+1][x-1][y][z] += dp[i][x][y][z] * (x * (x - 1) / 2) / (sum * (sum-1) / 2); 
                    if(y >= 2) dp[i+1][x][y-1][z] += dp[i][x][y][z] * (y * (y - 1) / 2) / (sum * (sum-1) / 2); 
                    if(z >= 2) dp[i+1][x][y][z-1] += dp[i][x][y][z] * (z * (z - 1) / 2) / (sum * (sum-1) / 2); 
                    if(x >= 1 && y >= 1) dp[i+1][x][y][z] += dp[i][x][y][z] * (x * y) / (sum * (sum-1) / 2);
                    if(y >= 1 && z >= 1) dp[i+1][x][y][z] += dp[i][x][y][z] * (y * z) / (sum * (sum-1) / 2);
                    if(z >= 1 && x >= 1) dp[i+1][x][y][z] += dp[i][x][y][z] * (z * x) / (sum * (sum-1) / 2);
                }
            }
        }
    }
    double A = 0, B = 0, C = 0;
    rep(x, 0, a+1) rep(y, 0, b+1) rep(z, 0, c+1) {
        A += dp[n][x][y][z] * (a - x);
        B += dp[n][x][y][z] * (b - y);
        C += dp[n][x][y][z] * (c - z);
    }
    printf("%.20lf %.20lf %.20lf\n", A, B, C);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}