#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[" << __LINE__ << ' ' << #x << "]: " << (x) << endl

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int dx, dy, k;
    cin >> dx >> dy >> k;

    pair<int, int> winds[k];
    vector<vector<vector<bool>>> a(dx, vector<vector<bool>>(dy, vector<bool>(k)));
    vector<vector<int>> b(dx, vector<int>(dy));
    for (int i=0; i<k; i++) {
        cin >> winds[i].first >> winds[i].second;
        int c;
        cin >> c;
        for (int j=0; j<c; j++) {
            int x, y;
            cin >> x >> y;
            x--, y--;
            a[x][y][i] = true;
            b[x][y] = 2;
        }
    }

    queue<pair<int, int>> q;
    for (int i=0; i<dx; i++) for (int j=0; j<dy; j++) if (b[i][j]) {
        for (int l=0; l<k; l++) if (!a[i][j][l]) {
            q.emplace(i-winds[l].first, j-winds[l].second);
        }
    }

    while (!q.empty()) {
        auto [i, j] = q.front();
        q.pop();
        if (b[i][j]) continue;
        b[i][j] = 2;

        for (int l=0; l<k; l++) if (!a[i][j][l]) {
            q.emplace(i-winds[l].first, j-winds[l].second);
        }
    }

    for (int j=0; j<dy; j++) {
        for (int i=0; i<dx; i++) cout << (b[i][j] ? '#' : '.');
        cout << '\n';
    }
    cout << '\n';

    for (int i=0; i<dx; i++) for (int j=0; j<dy; j++) if (b[i][j] != 2) {
        b[i][j] = 1;
        bool illegal = false;
        for (int l=0; l<k; l++) {
            int di = i - winds[l].first;
            int dj = j - winds[l].second;
            if (di < 0 || di >= dx || dj < 0 || dj >= dy) illegal = true;

            di = i + winds[l].first;
            dj = j + winds[l].second;
            if (di < 0 || di >= dx || dj < 0 || dj >= dy) continue;
            if (b[di][dj] == 2) illegal = true;
        }
        if (illegal) q.emplace(i, j);
    }

    while (!q.empty()) {
        auto [i, j] = q.front();
        q.pop();
        if (i < 0 || i >= dx || j < 0 || j >= dy || b[i][j] == 2) continue;
        b[i][j] = 0;

        for (int l=0; l<k; l++) if (!a[i][j][l]) {
            q.emplace(i+winds[l].first, j+winds[l].second);
        }
    }

    for (int j=0; j<dy; j++) {
        for (int i=0; i<dx; i++) cout << (b[i][j] ? '#' : '.');
        cout << '\n';
    }
}