#include <bits/stdc++.h>
using namespace std;
bool mark[21][32][162005], mem[21][32][162005];
int add[32][32];
int v[5][20], sz[20], a[10], b[20], ans[20];
bool solve(int cur, int m, int mask, int st) {
  if (mark[cur][mask][st]) return mem[cur][mask][st];
  mark[cur][mask][st] = true;
  if (cur == m) return mem[cur][mask][st] = (st == 0);
  for (int i = 0; i < sz[b[cur]]; i++) {
    st += add[mask][v[b[cur]][i]];
    int newmask = v[b[cur]][i];
    if (solve(cur + 1, m, newmask, st)) {
      ans[cur] = v[b[cur]][i];
      return mem[cur][mask][st] = true;
    }
    st -= add[mask][v[b[cur]][i]];
  }
  return mem[cur][mask][st] = false;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < (1 << n); i++) {
    bool last = false;
    int cnt = 0;
    for (int j = 0; j < n; j++) {
      if ((i >> j) & 1) {
        if (!last) {
          last = true;
          cnt++;
        }
      } else
        last = false;
    }
    v[cnt][sz[cnt]++] = i;
  }
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int j = 0; j < m; j++) cin >> b[j];
  int st = 0, e = 1;
  for (int i = 0; i < n; i++) {
    st += e * a[i];
    for (int j = 0; j < 32; j++)
      for (int k = 0; k < 32; k++)
        if (((j >> i) & 1) == 0 && ((k >> i) & 1)) add[j][k] -= e;
    e *= 11;
  }
  solve(0, m, 0, st);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) cout << (((ans[j] >> i) & 1) ? '*' : '.');
    cout << endl;
  }
  return 0;
}
