#include <bits/stdc++.h>

using namespace std;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VL = vector<LL>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define FILL(a, b) memset(a, b, sizeof(a))

int row[9][9], col[9][9], sq[9][9];
int pr[9][9];
int pc[9][9];

int ans[9][9];

void readRow(int r)
{
	int a, b;
	cin >> a >> b;
	pr[r][1] = a;
	pr[r][2] = b;
	cin >> a >> b;
	pr[r][4] = a;
	pr[r][5] = b;
	cin >> a >> b;
	pr[r][7] = a;
	pr[r][8] = b;
}

void readCol(int c)
{
	FOR (i, 0, 9) 
	{
		int a;
		cin >> a;
		pc[c][i] = a;
	}
}


void solve(int x, int y)
{
	if (x == 9)
	{
		FOR (i, 0, 9)
		{
			FOR (j, 0, 9) cout << ans[i][j] + 1 << ' ';
			cout << '\n';
		}
		exit(0);
	}
	if (y == 9)
	{
		solve(x + 1, 0);
		return;
	}
	if (ans[x][y] != -1)
	{
		solve(x, y + 1);
		return;
	}
	int idx = x / 3 * 3 + y / 3;
	FOR (i, 0, 9)
	{
		if (row[x][i] || col[y][i] || sq[idx][i]) continue;
		
		if (pr[x][y])
		{
			assert(y > 0);
			int mx = max(i, ans[x][y - 1]) + 1;
			int mn = min(i, ans[x][y - 1]) + 1;
			if (mx / mn != pr[x][y]) continue;
		}
		
		if (pc[x][y])
		{
			assert((x % 3) > 0);
			int mx = max(i, ans[x - 1][y]) + 1;
			int mn = min(i, ans[x - 1][y]) + 1;
			if (mx / mn != pc[x][y]) continue;
		}
		ans[x][y] = i;
		row[x][i] = 1;
		col[y][i] = 1;
		sq[idx][i] = 1;
		
		solve(x, y + 1);
		
		ans[x][y] = -1;
		row[x][i] = 0;
		col[y][i] = 0;
		sq[idx][i] = 0;
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	FOR (i, 0, 9)
		FOR (j, 0, 9)
			ans[i][j] = -1;
	
	int k;
	cin >> k;
	FOR (i, 0, 3)
	{	
		readRow(i * 3 + 0);
		readCol(i * 3 + 1);
		readRow(i * 3 + 1);
		readCol(i * 3 + 2);
		readRow(i * 3 + 2);
	}
	
	FOR (i, 0, k)
	{
		int x, y, z;
		cin >> x >> y >> z;
		x--, y--, z--;
		ans[x][y] = z;
		row[x][z] = 1;
		col[y][z] = 1;
		sq[(x / 3) * 3 + y / 3][z] = 1;
	}
	solve(0, 0);
}