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

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) {
      res = res * t;
    }
    t = t * t;
    n >>= 1;
  }
  return res;
}
i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

void _main() {
  vector<vector<i64>> a(2, vector<i64>(2, 0));
  vector<vector<i64>> b(2, vector<i64>(2, 0));
  vector<vector<i64>> ans(2, vector<i64>(2, 0));
  for (i64 i = 0; i < 2; i++) {
    for (i64 j = 0; j < 2; j++) {
      cin >> a[i][j];
    }
  }
  for (i64 i = 0; i < 2; i++) {
    for (i64 j = 0; j < 2; j++) {
      cin >> b[i][j];
    }
  }
  {
    vector<vector<i64>> nans(2, vector<i64>(2, 0));
    for (i64 i = 0; i < 2; i++) {
      for (i64 j = 0; j < 2; j++) {
        for (i64 k = 0; k < 2; k++) {
          nans[i][j] += a[i][k] * b[k][j];
        }
      }
    }
    swap(ans, nans);
  }
  {
    vector<vector<i64>> nans(2, vector<i64>(2, 0));
    for (i64 i = 0; i < 2; i++) {
      for (i64 j = 0; j < 2; j++) {
        for (i64 k = 0; k < 2; k++) {
          nans[i][j] += ans[i][k] * a[k][j];
        }
      }
    }
    swap(ans, nans);
  }
  {
    vector<vector<i64>> nans(2, vector<i64>(2, 0));
    for (i64 i = 0; i < 2; i++) {
      for (i64 j = 0; j < 2; j++) {
        for (i64 k = 0; k < 2; k++) {
          nans[i][j] += ans[i][k] * b[k][j];
        }
      }
    }
    swap(ans, nans);
  }
  for (i64 i = 0; i < 2; i++) {
    for (i64 j = 0; j < 2; j++) {
      cout << ans[i][j] << " ";
    }
    cout << "\n";
  }
}