#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__uint128_t;
const int N=1e3+5,M=N*8+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const int INF=1e9+7;mt19937 rnd(263082);
int dx,dy,k,wx[N],wy[N];
int v[N][N],vs[11][N][N];
int CK(int x,int y){return x>=1&&x<=dx&&y>=1&&y<=dy;}
void Solve(){
	int i,j,h;scanf("%d%d%d",&dy,&dx,&k);
	for(i=1;i<=k;i++){
		scanf("%d%d",&wy[i],&wx[i]);wy[i]=-wy[i];wx[i]=-wx[i];
		int x;scanf("%d",&x);
		while(x--) {int y,z;scanf("%d%d",&z,&y);v[y][z]=1;vs[i][y][z]=1;if(CK(y+wx[i],z+wy[i])) v[y+wx[i]][z+wy[i]]=-1;}
	} 
	
	for(i=1;i<=dx;i++){
		for(j=1;j<=dy;j++) for(h=1;h<=k;h++) if(!CK(i+wx[h],j+wy[h])&&!vs[h][i][j]) v[i][j]=-1/*,cerr<<i<<' '<<j<<' '<<h<<'\n'*/;
	}
	/*for(i=1;i<=dx;i++) {
		for(j=1;j<=dy;j++) printf("%c",v[i][j]==1?'#':'.');printf("\n");
	}
	printf("\n");*/
	queue<pii> q;for(i=1;i<=dx;i++) for(j=1;j<=dy;j++) if(v[i][j]) q.emplace(i,j);
	while(!q.empty()){
		auto p=q.front();q.pop();//cerr<<p.fi<<' '<<p.se<<'\n';
		if(v[p.fi][p.se]==1){
			for(j=1;j<=k;j++) {
				int x=p.fi+wx[j],y=p.se+wy[j];
				if(vs[j][p.fi][p.se]||!CK(x,y)||v[x][y]) continue;
				v[x][y]=1;q.emplace(x,y);//cerr<<x<<' '<<y<<'\n';
			} 
		}else{
			for(j=1;j<=k;j++) {
				int x=p.fi-wx[j],y=p.se-wy[j];
				if(!CK(x,y)||vs[j][x][y]||v[x][y]) continue;
				v[x][y]=-1;q.emplace(x,y);
			}
		}
	}
	for(i=1;i<=dx;i++) {
		for(j=1;j<=dy;j++) printf("%c",v[i][j]==1?'#':'.');printf("\n");
	}
	printf("\n");
	for(i=1;i<=dx;i++) {
		for(j=1;j<=dy;j++) printf("%c",v[i][j]==-1?'.':'#');printf("\n");
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}