#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    int n,a,b,c;
    cin >> a >> b >> c >> n;
    vector<vector<vector<vector<double>>>> dp(n+1,vector<vector<vector<double>>>(a+1,vector<vector<double>>(b+1,vector<double>(c+1,0))));
    dp[0][a][b][c] = 1;
    rep(i,n){
        for(double j=1;j<=a;j++){
            for(double k=1;k<=b;k++){
                for(double l=1;l<=c;l++){
                    double na,nb,nc;
                    na = dp[i][j][k][l] * (j/(j+k+l)) * ((j-1)/(j+k+l-1));
                    nb = dp[i][j][k][l] * (k/(j+k+l)) * ((k-1)/(j+k+l-1));
                    nc = dp[i][j][k][l] * (l/(j+k+l)) * ((l-1)/(j+k+l-1));
                    //printf("%.6lf %.6lf %.6lf\n",na,nb,nc);
                    dp[i+1][j-1][k][l] += na;
                    dp[i+1][j][k-1][l] += nb;
                    dp[i+1][j][k][l-1] += nc;
                    dp[i+1][j][k][l] += dp[i][j][k][l] - na - nb - nc;
                }
            }
        }
    }
    double ansa = 0, ansb = 0, ansc = 0;
    rep(i,a+1){
        rep(j,b+1){
            rep(k,c+1){
                ansa += (a-(double)i) * dp[n][i][j][k];
                ansb += (b-(double)j) * dp[n][i][j][k];
                ansc += (c-(double)k) * dp[n][i][j][k];
            }
        }
    }
    printf("%.12lf %.12lf %.12lf\n",ansa,ansb,ansc);
    return 0;
}