#include <vector>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define F(i, k) for(int16_t i = 0; i < (k); ++i)
#define G(x) int16_t x; cin >> x;
#define D for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) cout << gr[i][j] << " \n"[j == m];
#define MT(r, c, i) (!i ? r : c)
#define N 15
#define M 2

int16_t n = -1, m = -1;
int16_t gr[N][N], mk[M][N];int8_t du[N][N], dl[N][N];
int16_t tbl[N][3];

#define ADD(r, c, x) { gr[r][c] ^= x; F(i, M) mk[i][MT(r, c, i)] ^= 1 << x; }

bool bT(int16_t r, int16_t c) {
    if(r > n) return true;
    int16_t rI = r + (c == m), cI = c % m + 1;
    if(gr[r][c]) return bT(rI, cI);
    int16_t mask = mk[0][r] & mk[1][c]
        & tbl[gr[r - 1][c]][du[r][c]] & tbl[gr[r][c - 1]][dl[r][c]]
        & tbl[gr[r + 1][c]][du[r + 1][c]] & tbl[gr[r][c + 1]][dl[r][c + 1]];
    for(int16_t x = __builtin_ctzll(mask); mask >> x; ++x) if((mask >> x) & 1) {
        ADD(r, c, x);
        if(bT(rI, cI)) return true;
        ADD(r, c, x);
    }
    return false;
}
vector<pair<int,int>> ord;
bool bT(int idx) {
    if(idx >= n*m) return true;
    auto [r,c] = ord[idx];
    // cout << r << " " << c << endl;
    // cout << "\t" << idx << endl;
    if(gr[r][c]) return bT(idx+1);
    int16_t mask = mk[0][r] & mk[1][c]
        & tbl[gr[r - 1][c]][du[r][c]] & tbl[gr[r][c - 1]][dl[r][c]]
        & tbl[gr[r + 1][c]][du[r + 1][c]] & tbl[gr[r][c + 1]][dl[r][c + 1]];
    for(int16_t x = __builtin_ctzll(mask); mask >> x; ++x) if((mask >> x) & 1) {
        ADD(r, c, x);
        if(bT(idx+1)) return true;
        ADD(r, c, x);
    }
    return false;
}

void init() {
    cin >> n; G(k) m = n;
    fill_n(tbl[0], 3, (1 << 15) - 1);
    F(i, n + 1) if(i) {
        tbl[i][0] = (1 << 15) - 1; //no constraint
        tbl[i][2] = 5 << (i - 1); //diamond
        tbl[i][1] = ~tbl[i][2]; //no diamond
    }
    F(q, 2 * n - 1) if(q & 1) {
        int16_t r = (q + 1) / 2;
        string s; cin >> s;
        F(i, n) du[r + 1][i + 1] = 1 + (s[i] == '1');
    } else {
        int16_t r = q / 2;
        string s; cin >> s;
        F(i, n) if(i) dl[r + 1][i + 1] = 1 + (s[i - 1] == '1');
    }
    F(i, M) fill_n(mk[i], N, (1 << (n + 1)) - 2);
    queue<pair<int,int>> q;
    while(k--) {
        G(r) G(c) G(v)
        ADD(r, c, v);
        q.emplace(r,c);
    }
    #define K first 
    #define V second
    vector<vector<bool>> done(n+1,vector<bool>(m+1));
    vector<pair<int,int>> delta = {{1,0},{-1,0},{0,1},{0,-1}};
    assert(not q.empty());
    while(not q.empty()){
        auto [r,c] = q.front(); q.pop();
        if(done[r][c]) continue;
        done[r][c]=true;
        ord.emplace_back(r,c);
        for(auto [dr,dc] : delta){
            int nr=r+dr,nc=c+dc;
            if(nr<1 or nc<1 or nr>n or nc>m) continue;
            if(!done[nr][nc]) q.emplace(nr,nc);
        }
    }
    // for(int j = 1;j<=m;j++) for(int i = 1;i<=n;i++) ord.emplace_back(i,j);
    // ranges::sort(ord,[&](pair<int,int> p1,pair<int,int> p2){return p1.K-p1.V < p2.K-p2.V;});
    // mt19937 gen(__builtin_ia32_rdtsc());
    // ranges::shuffle(ord,gen);
}

int main() {
    clock_t t = clock();
    init(); bT(0); D
    // cout << (clock() - t) / (double)(CLOCKS_PER_SEC) << '\n';
}