#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

double dp[51][51][51][51][3];
bool used[51][51][51][51];
void rec(int a,int b,int c,int n){
   if(used[a][b][c][n])return;
   used[a][b][c][n]=1;
   if(n==0)return;

   double rem=1;
   int m=a+b+c;
   if(a>=2){
      rec(a-1,b,c,n-1);
      rep(j,0,3){
         dp[a][b][c][n][j]+=(dp[a-1][b][c][n-1][j]+(j==0))*(a*(a-1))*1./(m*(m-1));
      }
      rem-=(a*(a-1))*1./(m*(m-1));
   }
   if(b>=2){
      rec(a,b-1,c,n-1);
      rep(j,0,3){
         dp[a][b][c][n][j]+=(dp[a][b-1][c][n-1][j]+(j==1))*(b*(b-1))*1./(m*(m-1));
      }
      rem-=(b*(b-1))*1./(m*(m-1));
   }
   if(c>=2){
      rec(a,b,c-1,n-1);
      rep(j,0,3){
         dp[a][b][c][n][j]+=(dp[a][b][c-1][n-1][j]+(j==2))*(c*(c-1))*1./(m*(m-1));
      }
      rem-=(c*(c-1))*1./(m*(m-1));
   }
   rec(a,b,c,n-1);
   rep(j,0,3){
      dp[a][b][c][n][j]+=(dp[a][b][c][n-1][j])*rem;
   }
   return;
}

int main(){
   int a,b,c,n;
   cin>>a>>b>>c>>n;
   rec(a,b,c,n);
   rep(i,0,3){
      printf("%.12f",dp[a][b][c][n][i]);
      cout<<(i==2?'\n':' ');
   }
   return 0;
}