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

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll A, B, C, N;
    cin >> A >> B >> C >> N;

    auto dp = make_vec(N+1, A+1, B+1, C+1, 3, (double)0);
    auto check = make_vec(N+1, A+1, B+1, C+1, 3, false);

    auto rec = [&](auto self, ll n, ll a, ll b, ll c, ll idx) -> double{
        if(check[n][a][b][c][idx]) return dp[n][a][b][c][idx];
        if(n == 0) return 0;

        ll S = a + b + c;
        double res = 0;
        double pa = (double)a*(a-1)/(S*(S-1));
        double pb = (double)b*(b-1)/(S*(S-1));
        double pc = (double)c*(c-1)/(S*(S-1));

        double ga = 0, gb = 0, gc = 0;
        if(idx == 0) ga = 1.0;
        if(idx == 1) gb = 1.0;
        if(idx == 2) gc = 1.0;

        if(a > 1) res += pa * (self(self, n-1, a-1, b, c, idx) + ga);
        if(b > 1) res += pb * (self(self, n-1, a, b-1, c, idx) + gb);
        if(c > 1) res += pc * (self(self, n-1, a, b, c-1, idx) + gc);
        res += (1.0 - pa - pb - pc) * self(self, n-1, a, b, c, idx);

        dp[n][a][b][c][idx] = res;
        check[n][a][b][c][idx] = true;

        return res;
    };

    cout << rec(rec, N, A, B, C, 0) spa rec(rec, N, A, B, C, 1) spa rec(rec, N, A, B, C, 2)<< endl;

    return 0;
}