#pragma GCC optimization ("O3")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;

#define INF (1LL<<61)
#define MOD 1000000007LL 
//#define MOD 998244353LL
#define EPS (1e-10)

#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORE(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) {ASC((x)); REV((x));}
#define BIT(s,i) (((s)>>(i))&1)
#define pb push_back
#define fi first
#define se second

template<class T> inline int chmin(T& a, T b) {if(a>b) {a=b; return 1;} return 0;}
template<class T> inline int chmax(T& a, T b) {if(a<b) {a=b; return 1;} return 0;}
class mint {
public:
    ll x;
    mint(ll x=0) : x((x%MOD+MOD)%MOD) {}
    mint operator-() const {return mint(-x);}
    mint& operator+=(const mint& a) {if((x+=a.x)>=MOD) x-=MOD; return *this;}
    mint& operator-=(const mint& a) {if((x+=MOD-a.x)>=MOD) x-=MOD; return *this;}
    mint& operator*=(const mint& a) {(x*=a.x)%=MOD; return *this;}
    mint operator+(const mint& a) const {mint b(*this); return b+=a;}
    mint operator-(const mint& a) const {mint b(*this); return b-=a;}
    mint operator*(const mint& a) const {mint b(*this); return b*=a;}
    mint pow(ll t) const {if(!t) return 1; mint a=pow(t>>1); return (t&1?*this*a:a)*a;}
    mint inv() const {return pow(MOD-2);}
    mint& operator/=(const mint& a) {return *this*=a.inv();}
    mint operator/(const mint& a) const {mint b(*this); return b/=a;}
};
istream &operator>>(istream& is, mint& a) {ll t; is>>t; a=t; return is;}
ostream &operator<<(ostream& os, const mint& a) {return os<<a.x;}
using mvec = vector<mint>;
using mmat = vector<mvec>;
using dvec = vector<double>;
using dmat = vector<dvec>;

double dpa[51][51][51][51];
double dpb[51][51][51][51];
double dpc[51][51][51][51];

int main()
{
    ll A, B, C, N;
    cin >> A >> B >> C >> N;
    
    REP(i,1,N+1) {
        REP(a,1,A+1) {
            REP(b,1,B+1) {
                REP(c,1,C+1) {
                    double t = a+b+c;
                    t = t*(t-1)/2.0;
                    double p = a*(a-1)/2.0/t;
                    double q = b*(b-1)/2.0/t;
                    double r = c*(c-1)/2.0/t;
                    double s = 1.0-p-q-r;
                    dpa[i][a][b][c] += p*(dpa[i-1][a-1][b][c]+1.0);
                    dpa[i][a][b][c] += q*dpa[i-1][a][b-1][c];
                    dpa[i][a][b][c] += r*dpa[i-1][a][b][c-1];
                    dpa[i][a][b][c] += s*dpa[i-1][a][b][c];
                    dpb[i][a][b][c] += p*dpb[i-1][a-1][b][c];
                    dpb[i][a][b][c] += q*(dpb[i-1][a][b-1][c]+1.0);
                    dpb[i][a][b][c] += r*dpb[i-1][a][b][c-1];
                    dpb[i][a][b][c] += s*dpb[i-1][a][b][c];
                    dpc[i][a][b][c] += p*dpc[i-1][a-1][b][c];
                    dpc[i][a][b][c] += q*dpc[i-1][a][b-1][c];
                    dpc[i][a][b][c] += r*(dpc[i-1][a][b][c-1]+1.0);
                    dpc[i][a][b][c] += s*dpc[i-1][a][b][c];
                }
            }
        }
    }

    cout << setprecision(12) << dpa[N][A][B][C] << " " << dpb[N][A][B][C] << " " << dpc[N][A][B][C] << endl;

    return 0;  
}

/*



*/