#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
//#define mod 1000000007
#define mod 998244353
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
template<class T> using V=vector<T>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline void out(T a){ cout << a << '\n'; }
void YN(bool ok){if(ok) cout << "Yes" << endl; else cout << "No" << endl;}
//void YN(bool ok){if(ok) cout << "YES" << endl; else cout << "NO" << endl;}


const ll INF=1e18;
const int mx=200005;

double dp[55][55][55][55];
ll com[55][55];

int main(){
    //オーバーフローは大丈夫ですか？？
    cin.tie(0);ios::sync_with_stdio(false);
    int a,b,c,n;
    cin>>a>>b>>c>>n;
    rep(i,51){
        if(i==0) continue;
        com[i][0]=1;
        com[i][1]=i;
    }
    for(int i=2;i<=50;i++){
        for(int j=2;j<=i;j++){
            com[i][j]=com[i-1][j-1]+com[i-1][j];
        }
    }
    dp[0][0][0][0]=1;
    double A=0,B=0,C=0;
    rep(id,n){
        for(ll i=0;i<=a;i++){
            for(ll j=0;j<=b;j++){
                for(ll k=0;k<=c;k++){
                    ll rem=a+b+c-(i+j+k);
                    if(rem<2) continue;
                    rem=rem*(rem-1)/2;
                    double cur=dp[id][i][j][k];
                    if(a-i>=2) dp[id+1][i+1][j][k]+=(double)cur*(a-i)*(a-i-1)/2/rem;
                    if(b-j>=2) dp[id+1][i][j+1][k]+=(double)cur*(b-j)*(b-j-1)/2/rem;
                    if(c-k>=2) dp[id+1][i][j][k+1]+=(double)cur*(c-k)*(c-k-1)/2/rem;
                    ll x=(a-i)*(b-j)+(b-j)*(c-k)+(a-i)*(c-k);
                    dp[id+1][i][j][k]+=(double)cur*x/rem;
                }
            }
        }
    }
    rep(i,a+1){
        rep(j,b+1){
            rep(k,c+1){
                double cur=dp[n][i][j][k];
                A+=(double)i*cur;
                B+=(double)j*cur;
                C+=(double)k*cur;
            }
        }
    }
    cout<<FS<<(double)A<<' '<<(double)B<<' '<<(double)C<<endl;
}