#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010;
bool bd[11][N][N];
int st[N][N];
int dx,dy,k;
vector<PII> px;
void del(int x,int y);

void add(int x,int y) {
	//printf("add %d %d\n",x,y);
	assert(st[x][y]!=0);
	assert(x>=1&&x<=dx&&y>=1&&y<=dy);
	if (st[x][y]==1) return;
	st[x][y]=1;
	rep(i,0,k) {
		auto [wx,wy]=px[i];
		//printf("aa %d %d %d %d\n",x,y,x-wx,y-wy);
		if (bd[i][x][y]) {
			del(x-wx,y-wy);
		} else {
			add(x-wx,y-wy);
		}
	}
	//puts("---");
}
void del(int x,int y) {
	//printf("del %d %d\n",x,y);
	assert(st[x][y]!=1);
	if (!(x>=1&&x<=dx&&y>=1&&y<=dy)) return;
	if (st[x][y]==0) return;
	st[x][y]=0;
	rep(i,0,k) {
		auto [wx,wy]=px[i];
		int cx=x+wx,cy=y+wy;
		//printf("dd %d %d %d %d\n",x,y,cx,cy);
		if (cx>=1&&cx<=dx&&cy>=1&&cy<=dy&&bd[i][cx][cy]) {
			add(cx,cy);
		} else {
			del(cx,cy);
		}
	}
	//puts("---");
}

int main() {
	scanf("%d%d%d",&dx,&dy,&k);
	rep(i,0,k) {
		int wx,wy;
		scanf("%d%d",&wx,&wy);
		px.pb(mp(wx,wy));
		//printf("dir %d %d\n",wx,wy);
		int b;
		scanf("%d",&b);
		rep(j,0,b) {
			int x,y;
			scanf("%d%d",&x,&y);
			bd[i][x][y]=1;
		}
	}
	rep(i,1,dx+1) rep(j,1,dy+1) st[i][j]=-1;
	rep(v,0,k) rep(i,1,dx+1) rep(j,1,dy+1) if (bd[v][i][j]) add(i,j);
	rep(i,1,dx+1) rep(j,1,dy+1) if (st[i][j]==-1) {
		rep(v,0,k) {
			int cx=i-px[v].fi,cy=j-px[v].se;
			if (!(cx>=1&&cx<=dx&&cy>=1&&cy<=dy)) del(i,j);
		}
	}
	rep(j,1,dy+1) {
		rep(i,1,dx+1) {
			printf("%c","..#"[st[i][j]+1]);
		}
		puts("");
	}
	puts("");
	rep(j,1,dy+1) {
		rep(i,1,dx+1) {
			printf("%c","#.#"[st[i][j]+1]);
		}
		puts("");
	}

}