#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-18;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint998244353;

int dh[] = {-1,1,0,0};
int dw[] = {0,0,1,-1};


double dp[55][55][55][55];

int nC2(int n){
    return n*(n-1)/2;
}

int main(){
    int a,b,c,n; cin >> a >> b >> c >> n;
    dp[0][0][0][0] = 1;
    rep(i,n)rep(j,a+1)rep(k,b+1)rep(l,c+1){
        int sum = a-j + b-k + c-l;
        if(sum <= 1) continue;
        double p1 = (double)nC2(a-j)/nC2(sum);
        double p2 = (double)nC2(b-k)/nC2(sum);
        double p3 = (double)nC2(c-l)/nC2(sum);
        double p4 = 1.0-p1-p2-p3;
        dp[i+1][j][k][l] += p4*dp[i][j][k][l];
        dp[i+1][j+1][k][l] += p1*dp[i][j][k][l];
        dp[i+1][j][k+1][l] += p2*dp[i][j][k][l];
        dp[i+1][j][k][l+1] += p3*dp[i][j][k][l];

    }

    cout << fixed << setprecision(10);
    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]*i;
        ans2 += dp[n][i][j][k]*j;
        ans3 += dp[n][i][j][k]*k;
    }
    cout << ans1 << " " << ans2 << " " << ans3 << endl;
}