#include #include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf 10000000000000000 array dp[55][55][55][55]; bool f[55][55][55][55]; array get(int n,int a,int b,int c){ if(f[n][a][b][c]){ return dp[n][a][b][c]; } if(n==0){ return {0,0,0}; } f[n][a][b][c] = true; double s = a+b+c; double p = 1.0; array ret; rep(i,3)ret[i] = 0; if(a>=2){ double t = a * (a-1); t /= s * (s-1); auto r = get(n-1,a-1,b,c); r[0] += 1.0; rep(i,3)ret[i] += r[i] * t; p -= t; } if(b>=2){ double t = b * (b-1); t /= s * (s-1); auto r = get(n-1,a,b-1,c); r[1] += 1.0; rep(i,3)ret[i] += r[i] * t; p -= t; } if(c>=2){ double t = c * (c-1); t /= s * (s-1); auto r = get(n-1,a,b,c-1); r[2] += 1.0; rep(i,3)ret[i] += r[i] * t; p -= t; } auto r = get(n-1,a,b,c); rep(i,3)ret[i] += r[i] * p; dp[n][a][b][c] = ret; return ret; } int main(){ int A,B,C,N; cin>>A>>B>>C>>N; auto ans = get(N,A,B,C); rep(i,3){ if(i!=0)cout<<' '; cout<