#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define R(i, x, y) for (int i = (x); i >= (y); i--)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
#define double long double

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

const int N = 15;
const int M = 2e5 + 5;

int n, S, flg;
int pw[N], op[3][3], top[3][3];

struct poly {
	
	ll a, b, c; // a + bx + cx ^ 2
	
	poly () : a(0), b(0), c(0) { }
	poly (ll _a, ll _b, ll _c) : a(_a), b(_b), c(_c) { }
	poly (ll x) : a(x), b(0), c(0) { }
	
	poly operator + (const poly &r) const {
		return poly(a + r.a, b + r.b, c + r.c);
	}
	
	poly operator - (const poly &r) const {
		return poly(a - r.a, b - r.b, c - r.c);
	}
	
	poly operator * (const poly &r) const {
		return poly(a * r.a + b * r.c + c * r.b, a * r.b + r.a * b + c * r.c, a * r.c + b * r.b + c * r.a);
	}
	
	ll val() {
		return a - b / 2 - c / 2;
	}
	
	bool operator == (const poly &r) const {
		return (a == r.a) && (b == r.b) && (c == r.c);
	}
	
};

const poly W[3] = { 
	poly(1, 0, 0), 
	poly(0, 1, 0), 
	poly(0, 0, 1)
};

poly f[N][M], g[N][M], h[N][M];
poly a[5][3], b[5][3], c[5][3];

void FWT(int d) {
	if (d == 1) {
		F (i, 0, 2) {
			h[d][i] = ll(0);
		}
		F (i, 0, 2) {
			F (j, 0, 2) {
				h[d][op[i][j]] = h[d][op[i][j]] + f[d][i] * g[d][j];
			}
		}
		return;
	}
	F (i, 0, pw[d] - 1) {
		h[d][i] = ll(0);
	}
	int k = pw[d - 1];
	F (t, 0, 4) {
		F (i, 0, k - 1) {
			f[d - 1][i] = f[d][i] * a[t][0] + f[d][i + k] * a[t][1] + f[d][i + 2 * k] * a[t][2];
			g[d - 1][i] = g[d][i] * b[t][0] + g[d][i + k] * b[t][1] + g[d][i + 2 * k] * b[t][2];
		}
		FWT(d - 1);
		F (i, 0, k - 1) {
			h[d][i] = h[d][i] + h[d - 1][i] * c[t][0];
			h[d][i + k] = h[d][i + k] + h[d - 1][i] * c[t][1];
			h[d][i + 2 * k] = h[d][i + 2 * k] + h[d - 1][i] * c[t][2];
		}
	}
}

bool chk(int o) {
	int fl = 0;
	F (A, 0, 26) {
		F (B, 0, 26) {
			F (C, 0, 26) {
				if (fl) {
					break;
				}
				int u[3], v[3], w[3];
				F (i, 0, 2) {
					u[i] = A / pw[i] % 3;
					v[i] = B / pw[i] % 3;
					w[i] = C / pw[i] % 3;
				}
				auto gt = [&](int i, int j) {
					if (!o) {
						return w[(u[i] + v[j]) % 3];
					} else {
						return w[max(u[i], v[j])];
					}
				};
				int df = 0;
				F (i, 0, 2) {
					F (j, 0, 2) {
						top[i][j] = gt(i, j);
						if (top[i][j] != op[i][j]) {
							df++;
						}
					}
				}
				if (df > 2) {
					continue;
				}
				fl = 1;
				F (i, 0, 2) {
					F (j, 0, 2) {
						if (!o) {
							a[i][j] = W[u[j] * i % 3];
							b[i][j] = W[v[j] * i % 3];
							c[i][w[j]] = c[i][w[j]] + W[(3 - i * j % 3) % 3];
						} else {
							a[i][j] = ll(u[j] <= i);
							b[i][j] = ll(v[j] <= i);
							if (i == j) {
								c[i][w[j]] = c[i][w[j]] + 1;
							}
							if (i + 1 == j) {
								c[i][w[j]] = c[i][w[j]] - 1;
							}
						}
					}
				}
				int t = 3;
				F (i, 0, 2) {
					F (j, 0, 2) {
						if (top[i][j] == op[i][j]) {
							continue;
						}
						a[t][i] = 1;
						b[t][j] = 1;
						c[t][top[i][j]] = (flg ? -1 : -3);
						c[t][op[i][j]] = (flg ? 1 : 3);
						t++;
					}
				}
			}
		}
	}
	return fl;
}

void solve() {
	F (i, 0, 2) {
		F (j, 0, 2) {
			cin >> op[i][j];
		}
	}
	cin >> n;
	pw[0] = 1;
	F (i, 1, 11) {
		pw[i] = pw[i - 1] * 3;
	}
	if (!chk(0)) {
		flg = 1;
		assert(chk(1));
	}
	S = pw[n];
	F (i, 0, S - 1) {
		cin >> f[n][i].a;
	}
	F (i, 0, S - 1) {
		cin >> g[n][i].a;
	}
	FWT(n);
	F (i, 0, S - 1) {
		cout << h[n][i].val() / (flg ? 1 : pw[n - 1]) << ' ';
	}
}

bool Med;
int main() {
//	 FIO("A");
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}