#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
double dp[55][55][55][55][3];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int a, b, c, n; cin >> a >> b >> c >> n;
	rep(i, a + 1)rep(j, b + 1)rep(k, c + 1)rep(l, n + 1) {
		if (0 == l)continue;
		int sum = i + j + k;
		if (2 > sum)continue;
		int zan = sum * (sum - 1) / 2;
		if (i >= 2) {
			zan -= i * (i - 1) / 2;
			double p = (double)(i * (i - 1)) / (double)(sum * (sum - 1));
			rep(m, 3) {
				dp[i][j][k][l][m] += dp[i - 1][j][k][l - 1][m] * p;
			}
			dp[i][j][k][l][0] += p;
		}
		if (j >= 2) {
			zan -= j * (j - 1) / 2;
			double p = (double)(j * (j - 1)) / (double)(sum * (sum - 1));
			rep(m, 3) {
				dp[i][j][k][l][m] += dp[i][j - 1][k][l - 1][m] * p;
			}
			dp[i][j][k][l][1] += p;
		}
		if (k >= 2) {
			zan -= k * (k - 1) / 2;
			double p = (double)(k * (k - 1)) / (double)(sum * (sum - 1));
			rep(m, 3) {
				dp[i][j][k][l][m] += dp[i][j][k - 1][l - 1][m] * p;
			}
			dp[i][j][k][l][2] += p;
		}
		{
			double p = (double)(zan) / (double)(sum * (sum - 1) / 2);
			rep(m, 3) {
				dp[i][j][k][l][m] += dp[i][j][k][l - 1][m] * p;
			}
		}
	}
	printf("%.16f\n", dp[a][b][c][n][0]);
	printf("%.16f\n", dp[a][b][c][n][1]);
	printf("%.16f\n", dp[a][b][c][n][2]);
	return 0;
}