#include using namespace std; #define For(i, a, b) for(int i = (a); i < (b); i++) #define rep(i, n) For(i, 0, n) #define rFor(i, a, b) for(int i = (a); i >= (b); i--) #define ALL(v) (v).begin(), (v).end() #define rALL(v) (v).rbegin(), (v).rend() #define SZ(v) ((int)(v).size()) using lint = long long; using ld = long double; const int INF = 2000000000; const lint LINF = 1000000000000000000; // 真上から反時計回り const int di[] = {-1, 0, 1, 0}; const int dj[] = {0, -1, 0, 1}; const int di8[] = {-1, -1, 0, 1, 1, 1, 0, -1}; const int dj8[] = {0, -1, -1, -1, 0, 1, 1, 1}; struct SetupIo { SetupIo() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } } setupio; template bool chmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template bool chmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } template T mypow(T a, T b) { T res = 1; while (b) { if (b & 1) { res *= a; } a *= a; b >>= 1; } return res; } template T modpow(T a, T b, T mod) { T res = 1; while (b) { if (b & 1) { res = (res * a) % mod; } a = (a * a) % mod; b >>= 1; } return res; } template vector> matmul(const vector> &a, const vector> &b) { int h = a.size(), w = b[0].size(); vector> res(h, vector(w)); for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { for (int k = 0; k < b.size(); k++) { res[i][j] += a[i][k] * b[k][j]; } } } return res; } int main() { vector> A(2, vector(2)), B(2, vector(2)); rep(i, 2) { rep(j, 2) { cin >> A[i][j]; } } rep(i, 2) { rep(j, 2) { cin >> B[i][j]; } } auto C = matmul(matmul(matmul(A, B), A), B); rep(i, 2) { rep(j, 2) { cout << C[i][j] << " "; } cout << "\n"; } }