#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

struct mat{
	ll v[2][2];
};

mat mul(mat a, mat b){
	mat ret;
	rep(i,0,2){
		rep(j,0,2){
			rep(k,0,2){
				ret.v[i][j] += a.v[i][k] * b.v[k][j];
			}
		}
	}
	return ret;
}

int main(){
	ll a, b, c, d; cin >> a >> b >> c >> d;
	mat v;
	v.v[0][0] = a;
	v.v[0][1] = b;
	v.v[1][0] = c;
	v.v[1][1] = d;
	mat w = mul(v, mul(v, v));
	cout << w.v[0][0] << ' ' << w.v[0][1] << '\n';
	cout << w.v[1][0] << ' ' << w.v[1][1] << '\n';
}