#include <bits/stdc++.h>
using namespace std;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int dx, dy, k; cin >> dx >> dy >> k; const int s = dx * dy;
    const auto &id = [&](int px, int py) { return px * dy + py; };
    const auto &valid = [&](int px, int py)
        { return 0 <= px && px < dx && 0 <= py && py < dy; };
    vector<vector<int>> g(s); vector<int> tp(s, 2), v(s, 0);
    for(int i = 1; i <= k; ++i) {
        vector<vector<int>> vis(dx, vector<int>(dy));
        int wx, wy, b; cin >> wx >> wy >> b;
        for(int j = 1, px, py; j <= b; ++j)
            cin >> px >> py, vis[px - 1][py - 1] = 1;
        for(int px = 0; px < dx; ++px)
            for(int py = 0; py < dy; ++py) {
                const int qx = px - wx, qy = py - wy;
                if(vis[px][py]) { tp[id(px, py)] = 1;
                    if(valid(qx, qy)) tp[id(qx, qy)] = 0; continue; }
                if(!valid(qx, qy)) { tp[id(px, py)] = 0; continue; }
                g[id(px, py)].push_back(id(qx, qy));
            }
    }
    const auto &dfs = [&](auto &&self, int x) -> void {
        if(v[x]) return; v[x] = 1; 
        if(tp[x] == 1) for(int y : g[x]) tp[y] = 1;
        for(int y : g[x]) self(self, y);
        if(tp[x] == 2) for(int y : g[x]) if(!tp[y]) tp[x] = 0;
    };
    for(int i = 0; i < s; ++i) dfs(dfs, i);
    for(int i = 0; i < dy; ++i, puts(""))
        for(int j = 0; j < dx; ++j) putchar(".#."[tp[id(j, i)]]);
    for(int i = 0; puts(""), i < dy; ++i)
        for(int j = 0; j < dx; ++j) putchar(".##"[tp[id(j, i)]]);
}