// #include <atcoder/lazysegtree>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

constexpr long long INF_LL = 2000000000000000000LL;
constexpr int INF = 1000000000;
constexpr long long MOD = 998244353;

#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;

int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
int sign[2] = {1, -1};

template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

ll modpow(ll a, ll b, ll m) {
    if(b == 0)
        return 1;
    ll t = modpow(a, b / 2, m);
    if(b & 1) {
        return (t * t % m) * a % m;
    } else {
        return t * t % m;
    }
}

template <class T>
T gcd(T m, T n) {
    if(n == 0) return m;
    return gcd(n, m % n);
}

struct edge {
    int to;
    ll cost;
    edge(int t, ll c) { to = t, cost = c; }
};

typedef vector<vector<int>> graph;

// using mint = modint998244353;
// constexpr int MAX_COM = 100001;
// mint fac[MAX_COM], ifac[MAX_COM];
// void initfac() {
//     fac[0] = ifac[0] = 1;
//     REP(i, 1, MAX_COM) fac[i] = i * fac[i - 1];
//     REP(i, 1, MAX_COM) ifac[i] = 1 / fac[i];
// }
// mint nCr(int n, int r){
//     if(r < 0 || n < r) return 0;
//     return fac[n] * ifac[n - r] * ifac[r];
// }

// typedef ll S;
// S op(S x, S y){ return min(x, y); }
// S e(){ return INF_LL; }
// typedef ll F;
// S mapping(F f, S x){ 
//     if(f == -1) return x;
//     return f;
// }
// F composition(F f, F g){ 
//     if(f == -1) return g;
//     return f; 
// }
// F id(){ return -1; }

double dp[52][52][52][52];

void solve(){
    int a, b, c, n;
    cin >> a >> b >> c >> n;
    dp[0][a][b][c] = 1;
    rep(i, n) {
        for(int j=a; j>=0; j--) for(int k=b; k>=0; k--) for(int l=c; l>=0; l--){
            double t = (double)(j + k + l) * (j + k + l - 1);
            if(t < 1e-9){
                dp[i + 1][j][k][l] += dp[i][j][k][l];
            }else{
                if(j > 0) dp[i + 1][j - 1][k][l] += dp[i][j][k][l] * (double)j * (j - 1) / t;
                if(k > 0) dp[i + 1][j][k - 1][l] += dp[i][j][k][l] * (double)k * (k - 1) / t;
                if(l > 0) dp[i + 1][j][k][l - 1] += dp[i][j][k][l] * (double)l * (l - 1) / t;
                dp[i + 1][j][k][l] += dp[i][j][k][l] * (1.0 - ((double)j * (j - 1) + (double)k * (k - 1) + (double)l * (l - 1)) / t);
            }
        }
    }
    double ans1 = 0, ans2 = 0, ans3 = 0;
    rep(i, a + 1) rep(j, b + 1) rep(k, c + 1){
        ans1 += dp[n][i][j][k] * (a - i);
        ans2 += dp[n][i][j][k] * (b - j);
        ans3 += dp[n][i][j][k] * (c - k);
    }
    cout << ans1 << " " << ans2 << " " << ans3 << endl;
}

int main(){
    cin.tie(0);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(16);

    // initfac();
    int t;
    t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}