#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define MAXC ((int)(1e3 + 5))

bool nm[MAXC][MAXC], ne[MAXC][MAXC], cbm[MAXC][MAXC];
int d[MAXC][MAXC];
int dx, dy;

bool is_grid(int x, int y) { return (x >= 0 && x < dx && y >= 0 && y < dy); }

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);

	int k;
	cin >> dx >> dy >> k;
	vector<int> wxs(k), wys(k);
	queue<pii> q_nm;
	for (int i = 0; i < k; i++) {
		int b;
		cin >> wxs[i] >> wys[i] >> b;
		for (int j = 0; j < b; j++) {
			int x, y;
			cin >> x >> y;
			x--, y--;
			ne[x - wxs[i]][y - wys[i]] = true;
			if (!nm[x][y]) {
				nm[x][y] = 1;
				q_nm.push(pii(x, y));
			}
		}
	}

	while (!q_nm.empty()) {
		int x, y;
		tie(x, y) = q_nm.front();
		q_nm.pop();
		for (int i = 0; i < k; i++) {
			int px = x - wxs[i];
			int py = y - wys[i];
			if (is_grid(px, py) && !ne[px][py] && !nm[px][py]) {
				nm[px][py] = true;
				q_nm.push(pii(px, py));
			}
		}
	}

	for (int i = 0; i < dx; i++)
		for (int j = 0; j < dy; j++)
			d[i][j] = k;

	queue<pii> q_cbm;
	for (int i = 0; i < dx; i++)
		for (int j = 0; j < dy; j++)
			if (nm[i][j]) {
				q_cbm.push(pii(i, j));
				cbm[i][j] = true;
			}

	while (!q_cbm.empty()) {
		int x, y;
		tie(x, y) = q_cbm.front();
		q_cbm.pop();
		for (int i = 0; i < k; i++) {
			int px = x + wxs[i];
			int py = y + wys[i];
			if (!is_grid(px, py) || nm[px][py] || ne[px][py])
				continue;
			d[px][py]--;
			if (d[px][py] == 0) {
				q_cbm.push(pii(px, py));
				cbm[px][py] = true;
			}
		}
	}

	for (int i = 0; i < dy; i++, cout << "\n")
		for (int j = 0; j < dx; j++)
			cout << ".#"[nm[j][i]];
	cout << "\n";
	for (int i = 0; i < dy; i++, cout << "\n")
		for (int j = 0; j < dx; j++)
			cout << ".#"[cbm[j][i]];

	return 0;
}