#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)

vector<vector<int>> mult(vector<vector<int>> m1, vector<vector<int>> m2){
    vector<vector<int>> result(2, vector<int>(2));
    result[0][0] = m1[0][0]*m2[0][0]+m1[0][1]*m2[1][0];
    result[0][1] = m1[0][0]*m2[0][1]+m1[0][1]*m2[1][1];
    result[1][0] = m1[1][0]*m2[0][0]+m1[1][1]*m2[1][0];
    result[1][1] = m1[1][0]*m2[0][1]+m1[1][1]*m2[1][1];
    return result;
}

void solve(){
    vector<vector<int>> m(2 ,vector<int>(2));
    cin >> m[0][0] >> m[0][1] >> m[1][0] >> m[1][1];
    vector<vector<int>> m1 = mult(m, m);
    vector<vector<int>> m2 = mult(m1, m);
    cout << m2[0][0]  << " " << m2[0][1] << endl << m2[1][0] << " " << m2[1][1];
}

int main(){

    int t = 1;
    //cin >> t;
    rep(i,0,t) solve();

    return 0;
}