#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
double dp[60][51][51][51];
int main(){
  ll a,b,c,n;cin >> a >> b >> c >> n;
  rep(i,60)rep(j,51)rep(k,51)rep(l,51)dp[i][j][k][l]=0;
  dp[0][a][b][c]=1;
  rep(i,n){
    rep(j,51){
      rep(k,51){
        rep(l,51){
          if(dp[i][j][k][l]==0)continue;
          double all=(j+k+l)*(j+k+l-1)/2;
          double sum=0;
          double cof=j*(j-1)/2;
          if(j)dp[i+1][j-1][k][l]+=dp[i][j][k][l]*cof/all;
          sum+=cof;
          cof=k*(k-1)/2;
          if(k)dp[i+1][j][k-1][l]+=dp[i][j][k][l]*cof/all;
          sum+=cof;
          cof=l*(l-1)/2;
          if(l)dp[i+1][j][k][l-1]+=dp[i][j][k][l]*cof/all;
          sum+=cof;
          dp[i+1][j][k][l]+=dp[i][j][k][l]*(all-sum)/all;
        }
      }
    }
  }
  vector<double> ans(3);
  rep(i,51)rep(j,51)rep(k,51){
    /*if(dp[n][i][j][k]!=0){
      cout << i <<" " << j <<" " << k <<" " << dp[n][i][j][k] << endl;
    }*/
    ans[0]+=dp[n][i][j][k]*(a-i);
    ans[1]+=dp[n][i][j][k]*(b-j);
    ans[2]+=dp[n][i][j][k]*(c-k);
  }
  CST(10);
  rep(i,3)cout << ans[i] <<" ";cout << endl;

}