#include <bits/stdc++.h>
using namespace std;
const int N = 5;
const int M = 20;
int n, m;
int a[N];
int b[M];
vector<int> Have[N];
int GetHave(int Mask) {
  int Res = 0;
  int Last = 0;
  for (int i = 0; i <= n; i++) {
    if (Mask & (1 << i)) {
      Last++;
    } else if (Last) {
      Res++;
      Last = 0;
    }
  }
  return Res;
}
int A[N];
int Ans[M];
bool Vis[M][1 << N][11][11][11][11][11];
void PutAns() {
  for (int i = 0; i < n; i++, puts(""))
    for (int j = 0; j < m; j++) printf("%c", (Ans[j] & (1 << i)) ? '*' : '.');
  exit(0);
}
bool CheckZero() {
  for (int i = 0; i < n; i++)
    if (A[i]) return false;
  return true;
}
bool CheckPositive() {
  for (int i = 0; i < n; i++)
    if (A[i] < 0) return false;
  return true;
}
void Update(int Last, int Mask, int Add) {
  for (int i = 0; i < n; i++)
    if (Mask & (1 << i))
      if (!(Last & (1 << i))) A[i] -= Add;
}
void Rec(int j = 0, int Last = 0) {
  if (j == m) {
    if (CheckZero()) PutAns();
    return;
  }
  if (Vis[j][Last][A[0]][A[1]][A[2]][A[3]][A[4]]) return;
  Vis[j][Last][A[0]][A[1]][A[2]][A[3]][A[4]] = true;
  for (int Mask : Have[b[j]]) {
    Ans[j] = Mask;
    Update(Last, Mask, +1);
    if (CheckPositive()) Rec(j + 1, Mask);
    Update(Last, Mask, -1);
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  for (int j = 0; j < m; j++) scanf("%d", b + j);
  for (int Mask = 0; Mask < (1 << n); Mask++)
    Have[GetHave(Mask)].push_back(Mask);
  for (int i = 0; i < n; i++) A[i] = a[i];
  Rec();
  assert(0);
}
