#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

typedef long long ll;


void print(vector<ll> v) {
    sort(v.begin(), v.end());
    cout << v[0] << " " << v[1] << " " << v[2] << endl;
}
int main() {
    vector<ll> v(3);
    cin >> v[0] >> v[1] >> v[2];

    ll x, n;
    cin >> x >> n;

    sort(v.begin(), v.end());
    ll diff = v[1] - v[0];
    ll a_add = (diff + x - 1) / x;

    if(n >= a_add) {
        n -= a_add;
        v[0] += a_add * x;
    }
    else {
        v[0] += n * x;
        print(v);
        return 0;
    }

    sort(v.begin(), v.end());
    diff = v[2] - v[1];
    ll diff2 = v[2] - v[0];
    ll b_add = (diff / x) + (diff2 / x);

    if(n >= b_add) {
        n -= b_add;
        v[1] += (diff / x) * x;
        v[0] += (diff2 / x) * x;
    }
    else {
        v[0] += (n / 2) * x;
        v[1] += ((n + 1) / 2) * x;
        print(v);
        return 0;
    }

    sort(v.begin(), v.end());
    ll c_add = n / 3;
    v[0] += c_add * x;
    v[1] += c_add * x;
    v[2] += c_add * x;

    if(n % 3 == 2) {
        v[0] += x;
        v[1] += x;
    }
    else if(n % 3 == 1) {
        if(v[0] <= v[1]) {
            v[0] += x;
        }
        else {
            v[1] += x;
        }
    }

    print(v);
    return 0;
}