#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

double f(int tip, int all) {
  return 1. * tip / all * (tip - 1) / (all - 1);
}

double g(int a, int b, int c) {
  int all = a + b + c;
  if (all < 2) return 0;
  vector<int> tip{a, b, c};
  double ans = 0;
  REP(i, 3) FOR(j, i + 1, 3) {
    ans += 1. * tip[i] / all * tip[j] / (all - 1);
    ans += 1. * tip[j] / all * tip[i] / (all - 1);
  }
  return ans;
}

int main() {
  int a, b, c, n; cin >> a >> b >> c >> n;
  vector dp(a + 1, vector(b + 1, vector(c + 1, 0.)));
  dp[a][b][c] = 1;
  while (n--) {
    vector nx(a + 1, vector(b + 1, vector(c + 1, 0.)));
    REP(i, a + 1) REP(j, b + 1) REP(k, c + 1) {
      if (i >= 2) nx[i - 1][j][k] += dp[i][j][k] * f(i, i + j + k);
      if (j >= 2) nx[i][j - 1][k] += dp[i][j][k] * f(j, i + j + k);
      if (k >= 2) nx[i][j][k - 1] += dp[i][j][k] * f(k, i + j + k);
      nx[i][j][k] += dp[i][j][k] * g(i, j, k);
    }
    dp.swap(nx);
  }
  double white = 0, black = 0, brown = 0;
  REP(i, a + 1) REP(j, b + 1) REP(k, c + 1) {
    white += (a - i) * dp[i][j][k];
    black += (b - j) * dp[i][j][k];
    brown += (c - k) * dp[i][j][k];
  }
  cout << white << ' ' << black << ' ' << brown << '\n';
  return 0;
}