#pragma GCC ta g("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
//#include <atcoder/maxflow>
//using namespace atcoder;
//const int mod = 1e9 + 7;
const int mod = 998244353;

using tud = tuple<double,double,double>;

array<double,3> dp[55][55][55][55];
bool v[55][55][55][55];

array<double,3> f(int n, int a, int b, int c){
    if(n == 0) return {0,0,0};
    if(v[n][a][b][c]) return dp[n][a][b][c];
    v[n][a][b][c] = true;
    if(a == 1 && b == 1 && c == 1) return dp[n][a][b][c] = {0,0,0};
    array<double,3> res = {0,0,0};
    ll s = a+b+c;
    ll al = s * (s-1) / 2;
    if(a >= 2){
        auto r = f(n-1,a-1,b,c);
        r[0] += 1;
        rep(i,3) res[i] += r[i] * a * (a-1) / 2 / al;
    }
    if(b >= 2){
        auto r = f(n-1,a,b-1,c);
        r[1] += 1;
        rep(i,3) res[i] += r[i] * b * (b-1) / 2 / al;
    }
    if(c >= 2){
        auto r = f(n-1,a,b,c-1);
        r[2] += 1;
        rep(i,3) res[i] += r[i] * c * (c-1) / 2 / al;
    }
    auto r = f(n-1,a,b,c);
    rep(i,3) res[i] += r[i] * (al - a*(a-1)/2 - b*(b-1)/2 - c*(c-1)/2) / al;
    return dp[n][a][b][c] = res;
}

int main(){
    int a,b,c,n; cin >> a >> b >> c >> n;
    auto res = f(n,a,b,c);
    printf("%.10f %.10f %.10f\n",res[0],res[1],res[2]);
}