#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

ld f(int sum,int a){
	return (ld)(a*(a-1))/(ld)(sum*(sum-1));
}

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int A,B,C,N;
	cin>>A>>B>>C>>N;
	vector<vector<vector<ld>>> em(A+1,vector<vector<ld>>(B+1,vector<ld>(C+1)));
	rep(i,A+1) rep(j,B+1) rep(k,C+1) em[i][j][k]=0.0;
	auto dp=em;
	dp[0][0][0]=1;
	rep(roop,N){
		auto n_dp=em;
		rep(i,A) rep(j,B) rep(k,C){
			int sum=A+B+C-i-j-k;
			ld tmp=0;
			n_dp[i+1][j][k]+=dp[i][j][k]*f(sum,A-i);
			n_dp[i][j+1][k]+=dp[i][j][k]*f(sum,B-j);
			n_dp[i][j][k+1]+=dp[i][j][k]*f(sum,C-k);
			tmp=f(sum,A-i)+f(sum,B-j)+f(sum,C-k);
			tmp=1-tmp;
			n_dp[i][j][k]+=dp[i][j][k]*tmp;
		}
		dp=n_dp;
	}
	ld a=0,b=0,c=0;
	rep(i,A) rep(j,B) rep(k,C){
		a+=(ld)i*dp[i][j][k];
		b+=(ld)j*dp[i][j][k];
		c+=(ld)k*dp[i][j][k];
	}
	cout<<setprecision(18);
	cout<<a<<" "<<b<<" "<<c<<"\n";
}