#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint A, B, C, N;
	cin >> A >> B >> C >> N;
	std::vector<std::vector<std::vector<double>>> dp(51, std::vector<std::vector<double>>(51, std::vector<double>(51)));

	double a=0, b=0, c=0, x, y, z;
	dp[A][B][C] = 1.0;
	rep(_, N) {
		repx(i, 1, 51) {
			repx(j, 1, 51) {
				repx(k, 1, 51) {
					dp[i-1][j][k] += dp[i][j][k] * (i-1) * i / (i+j+k) / (i+j+k-1);
					dp[i][j-1][k] += dp[i][j][k] * (j-1) * j / (i+j+k) / (i+j+k-1);
					dp[i][j][k-1] += dp[i][j][k] * (k-1) * k / (i+j+k) / (i+j+k-1);
					dp[i][j][k] -= dp[i][j][k] * (i-1) * i / (i+j+k) / (i+j+k-1) + dp[i][j][k] * (j-1) * j / (i+j+k) / (i+j+k-1) + dp[i][j][k] * (k-1) * k / (i+j+k) / (i+j+k-1);
				}
			}
		}
	}
	repx(i, 1, 51) {
		repx(j, 1, 51) {
			repx(k, 1, 51) {
				a += dp[i][j][k] * (A-i);
				b += dp[i][j][k] * (B-j);
				c += dp[i][j][k] * (C-k);
			}
		}
	}
	cout << fixed << setprecision(10) << a << ' ';
	cout << fixed << setprecision(10) << b << ' ';
	cout << fixed << setprecision(10) << c << endl;
}