#include<bits/stdc++.h>
using namespace std;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r+1)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
struct Edge {
  int to; ll w;
};
using Graph = vector<vector<int> >;
//using Graph = vector<vector<Edge> >;
const ll INF = 2e18;
//const int INF = 2e9;
template<class T> using vc = vector<T>;
template<class T> using vv = vector<vector<T> >;
template<class T> using vvv = vector<vector<vector<T> > >;
template<class T> using pq = priority_queue<T>;
template<class T> using pq_g = priority_queue<T, vc<T>, greater<T> >;
template<class T> istream& operator>>(istream& i, vc<T>& v) { rep(j, 0, v.size()) i>>v[j]; return i; }
template<class T> ostream& operator<<(ostream& o, vc<T>& v) { rep(j, 0, v.size()) o<<v[j]<<" "; return o; }
template<class T> bool chmin(T& a, T b) {
  if(a > b) {
      a = b;
      return true;
  }
  return false;
}
template<class T> bool chmax(T& a, T b) {
  if(a < b) {
      a = b;
      return true;
  }
  return false;
}

vv<ll> multiply(vv<ll> v1, vv<ll> v2) {
  vv<ll> res(2, vc<ll>(2));
  res[0][0] = v1[0][0]*v2[0][0] + v1[0][1]*v2[1][0];
  res[0][1] = v1[0][0]*v2[0][1] + v1[0][1]*v2[1][1];
  res[1][0] = v1[1][0]*v2[0][0] + v1[1][1]*v2[1][0];
  res[1][1] = v1[1][0]*v2[0][1] + v1[1][1]*v2[1][1];
  return res;
}
int main() {
  // 高速化
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  // 小数点の出力桁数を指定
  cout << fixed << setprecision(10);
  // メイン
  vv<ll> M(2, vc<ll>(2)), M_(2, vc<ll>(2));
  cin >> M >> M_;
  vv<ll> res = multiply(M, M_);
  vv<ll> res_ = multiply(res, res);
  rep(i, 0, 2) {
    rep(j, 0, 2) cout << res_[i][j] << " ";
    cout << endl;
  }

  return 0;
}