#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll A,B,C,N;cin>>A>>B>>C>>N;ld DP[A+1][B+1][C+1][N+1];
  REP(i,A+1)REP(j,B+1)REP(k,C+1)REP(n,N+1)DP[i][j][k][n]=0;DP[A][B][C][0]=1;
  REP(n,N){
    REP(i,A+1)REP(j,B+1)REP(k,C+1)if(i+j+k>1){
      DP[i-1][j][k][n+1]+=DP[i][j][k][n]*i*(i-1)/(i+j+k)/(i+j+k-1);
      DP[i][j-1][k][n+1]+=DP[i][j][k][n]*j*(j-1)/(i+j+k)/(i+j+k-1);
      DP[i][j][k-1][n+1]+=DP[i][j][k][n]*k*(k-1)/(i+j+k)/(i+j+k-1);
      DP[i][j][k][n+1]+=DP[i][j][k][n]*(1-(ld)(i*(i-1)+j*(j-1)+k*(k-1))/(i+j+k)/(i+j+k-1));
    }
  }
  ld a=0,b=0,c=0;
  REP(i,A+1)REP(j,B+1)REP(k,C+1){a+=DP[i][j][k][N]*i;b+=DP[i][j][k][N]*j;c+=DP[i][j][k][N]*k;}
  a=A-a;b=B-b;c=C-c;printf("%llf %llf %llf\n",a,b,c);
  return 0;
}