#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

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

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int a,b,c; cin >> a >> b >> c;
    int n; cin >> n;
    dp[a][b][c] = 1;
    for(int _=0;_<n;_++){
        for(int i=0;i<=a;i++){
            for(int j=0;j<=b;j++){
                for(int k=0;k<=c;k++){
                    ndp[i][j][k] = 0;
                }
            }
        }
        for(int i=0;i<=a;i++){
            for(int j=0;j<=b;j++){
                for(int k=0;k<=c;k++){
                    double m = i+j+k;
                    if(i+j+k<=1){
                        ndp[i][j][k] += dp[i][j][k];
                    }
                    else{
                        double tmp = 1;
                        double uaa = m*(m-1)/2.0;
                        if(i>=2){
                            double ua = i*(i-1)/2.0/uaa;
                            ndp[i-1][j][k] += dp[i][j][k]*ua;
                            tmp -= ua;
                        }
                        if(j>=2){
                            double ua = j*(j-1)/2.0/uaa;
                            ndp[i][j-1][k] += dp[i][j][k]*ua;
                            tmp -= ua;
                        }
                        if(k>=2){
                            double ua = k*(k-1)/2.0/uaa;
                            ndp[i][j][k-1] += dp[i][j][k]*ua;
                            tmp -= ua;
                        }
                        ndp[i][j][k] += dp[i][j][k]*tmp;
                    }
                }
            }
        }
        for(int i=0;i<=a;i++){
            for(int j=0;j<=b;j++){
                for(int k=0;k<=c;k++){
                    dp[i][j][k] = ndp[i][j][k];
                }
            }
        }
    }
    double aa=0,bb=0,cc=0;
    for(int i=0;i<=a;i++){
        for(int j=0;j<=b;j++){
            for(int k=0;k<=c;k++){
                aa+=dp[i][j][k]*(a-i);
                bb+=dp[i][j][k]*(b-j);
                cc+=dp[i][j][k]*(c-k);
            }
        }
    }
    printf("%.9f %.9f %.9f\n",aa,bb,cc);
}