#if not LOCAL
#define NDEBUG 1
#endif
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(auto i = a; i < (b); ++i)
#define down(x, a) for (auto x = a; x--;)
#define all(x) begin(x), end(x)
#define sz(x) int(size(x))
#define let auto const

using ll = long long;
using lint = ll;
using pii = pair<int, int>;
using vi = vector<int>;

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

  int x, y, k;
  cin>>x>>y>>k;

  vector<vi> grid(x, vector<int>(y));

  auto bound = [&](int cx, int cy) {
    return cx < x && cx >= 0 && cy < y && cy >= 0;
  };

  rep(t, 0, k) {
    int dx, dy;
    cin>>dx>>dy;
    int b;
    cin>>b;
    while(b--) {
      int px, py;
      cin>>px>>py;
      --px; --py;
      grid[px][py] = 1000;
      if(bound(px - dx, py - dy)) grid[px - dx][py - dy] = -1000;
      while(bound(px + dx, py + dy)){
        px += dx; py += dy;
        if(grid[px][py] < 0) break;
        ++grid[px][py];
      }
    }
  }

  rep(j, 0, y) {
    rep(i, 0, x) {
      cout<< (grid[i][j] >= 1000 ? '#' : '.');
    }
    cout<<'\n';
  }
  cout<<'\n';

  rep(j, 0, y) {
    rep(i, 0, x) {
      cout<< (grid[i][j] >= k ? '#' : '.');
    }
    cout<<'\n';
  }
}