#include<bits/stdc++.h>
using namespace std;
#define time chrono::system_clock::now().time_since_epoch().count()
mt19937_64 rnd(time);
#define maxn 1000005
#define int long long

int read() {int x;cin>>x;return x;}




struct point {
    int x, y;
    point operator-(const point& oth)const{return (point){x-oth.x,y-oth.y};}
    point operator+(const point& oth)const{return (point){x+oth.x,y+oth.y};}
    friend int dis(const point& A){return A.x * A.x + A.y * A.y;}
};

int cal(int x) {
    int val = max(0ll, (int)sqrt(x - 1) - 2ll);
    while((val + 1) * (val + 1) <= x) {
        val += 1;
    }
    return val;
}

void solve() {
    int OA = read(), OB = read(), OC = read(), OD = read();
    point a, b, c, d;
    a = {0, cal(OA)};
    auto print = [&]() {
        cout << a.y << " " << b.x << " " << b.y << " " << c.x << " " << c.y << " " << d.x << " " << d.y << "\n";
        return;
    };
    auto check = [&]() {
        point ab = (b - a);
        point ad = {-ab.y, ab.x};
        d = a + ad;
        c = a + ab + ad;
        if(dis(a) == OA && dis(b) == OB && dis(c) == OC && dis(d) == OD) {
            return 1;
        }
        return 0;
    };
    int limit = cal(OB) * 7 / 10;
    int res1 = -1;
    for(int i = cal(OB); i >= limit; i--) {
        int res = OB - i * i;
        if(res1 == -1) res1 = cal(res);
        if((res1) * (res1) > res) res1 -= 1;
        if(res1 * res1 == res) {
            b = {i, res1};
            if(check()) {
                print();
                return;
            }
            b = {res1, i};
            if(check()) {
                print();
                return;
            }
            b = {-i, res1};
            if(check()) {
                print();
                return;
            }
            b = {-res1, i};
            if(check()) {
                print();
                return;
            }
        }
    }
    // while(1);   
}

signed main() {
    #ifdef ONLINE_JUDGE
        ios::sync_with_stdio(false);
        cin.tie(0);cout.tie(0);
    #else
        //freopen("a.in", "r", stdin);
    #endif

    solve();
    return 0;
}