mzp_N2

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

bool cmp(vector <int> a, vector <int> b) {
    return a[0] > b[0];
}

vector <int> ans = {-1, -1, -1};
int A, B, C, n;

bool ok(int x) {
    int y, z, a, b, c;
    a = A + x;
    if (a % 2 == 1) {
        return 0;
    }
    b = a / 2;
    y = b - B;
    c = b;
    z = c - C;
    bool r = x + y + z <= n && y >= 0 && z >= 0;
    if (r) {
        ans[0] = x;
        ans[1] = y;
        ans[2] = z;
    }
    return r;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> A >> B >> C >> n;
    int l = 0 + A % 2, r = n + n % 2 + A % 2, m;
    while (l + 1 < r) {
        m = (l + r) / 2;
        if (ok(m)) {
            l = m;
        } else {
            r = m;
        }
    }
    if (ans[0] == -1) {
        cout << 0;
        exit(0);
    }
    for (int i: ans) {
        cout << i << "\n";
    }
}