#include<bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
using mint = modint998244353;
//g++ -I/opt/ac-library ./**.cpp
using namespace std;
using ll = long long;
using ull = unsigned long long;
//const long long MOD = 1000000007;
const long long MOD = 998244353;
const long double PI = 3.14159265358979;
const long long INF = 1LL<<60;
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
#define deb(var) do{cout << #var << " : "; view(var);}while(0)
template<typename T> void view(T e){cout << e << endl;}
void view(vector<string>& v){cout << endl;for(auto& s :v){view(s);}cout << endl;}
template<typename T> void view(vector<T>& v){for(auto& e :v){cout << e << " ";}cout << endl;}
template<typename T> void view(vector<vector<T>>& vv){cout << endl;for(auto& v:vv){view(v);}}
ll gcd(ll a, ll b){if (b == 0) return a;else return gcd(b, a % b);}
ll lcm(ll x,ll y){return ll(x/gcd(x,y))*y;}
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

vector<vector<int>> mat_prod(const vector<vector<int>> a, const vector<vector<int>> b) {
    int n = a.size();
    int m = a[0].size();
    int l = b[0].size();
    vector<vector<int>> c(n, vector<int> (l));
    for (int i=0; i<n; i++) {
        for (int j=0; j<l; j++) {
            for (int k=0; k<m; k++) {
                c[i][j] += a[i][k]*b[k][j];
            }
        }
    }
    return c;
}

vector<vector<int>> mat_pow(const vector<vector<int>> &a, int k) {
    vector<vector<int>> b = a;
    int n = a.size();
    vector<vector<int>> res(n, vector<int> (n, 0));
    for (int i=0; i<n; i++) res[i][i] = (int)1;
    for (int i=0; i<60; i++) {
        if (k>>i & 1LL == 1) {
            res = mat_prod(res, b);
        }
        b = mat_prod(b, b);
    }
    return res;
}

int32_t main() {
    vector<vector<int>> a(2, vector<int>(2));
    for (int i=0; i<2; i++) {
        for (int j=0; j<2; j++) {
            int b; cin >> b;
            a[i][j] = b;
        }
    }

    a = mat_prod(a, mat_prod(a, a));
    // a = mat_prod(a, a);

    cout << a[0][0] << " " << a[0][1] << "\n";
    cout << a[1][0] << " " << a[1][1] << "\n";
}