#include <bits/stdc++.h>
using namespace std;
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
template <typename T>
inline T Dis(T x1, T y1, T x2, T y2) {
  return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2));
}
template <typename T>
inline T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return (POW(B, P / 2) * POW(B, P / 2));
}
template <typename T>
inline T ABS(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
template <typename T>
inline T Gcd(T a, T b) {
  if (a < 0) return Gcd(-a, b);
  if (b < 0) return Gcd(a, -b);
  return (b == 0) ? a : Gcd(b, a % b);
}
template <typename T>
inline T Lcm(T a, T b) {
  if (a < 0) return Lcm(-a, b);
  if (b < 0) return Lcm(a, -b);
  return a * (b / Gcd(a, b));
}
long long Bigmod(long long base, long long power, long long MOD) {
  long long ret = 1;
  while (power) {
    if (power & 1) ret = (ret * base) % MOD;
    base = (base * base) % MOD;
    power >>= 1;
  }
  return ret;
}
long long ModInverse(long long number, long long MOD) {
  return Bigmod(number, MOD - 2, MOD);
}
int Set(int N, int pos) { return N = N | (1 << pos); }
int Reset(int N, int pos) { return N = N & ~(1 << pos); }
bool Chkbit(int N, int pos) { return (bool)(N & (1 << pos)); }
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
bool isConst(char ch) {
  if (isalpha(ch) && !isVowel(ch)) return true;
  return false;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
long long int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int n, m, a[22], b[22], AA;
short dp[21][33][11][11][11][11][11];
vector<int> Store[35];
short Solve(int col, int mask, int A[]);
char Ans[22][22];
short Dfs(int row, int col, int mask, int nmask, int A[], int p, int cnt) {
  if (AA) return 1;
  if (row == n) {
    if (b[col] != cnt) return 0;
    return Solve(col + 1, nmask, A);
  }
  int tp = 0, nm = nmask;
  if (!Chkbit(nmask, row)) tp = 1, nm = nm | (1 << row);
  tp = 0;
  if (!Chkbit(mask, row)) tp = 1, A[row]++;
  short ans = Dfs(row + 1, col, mask, nm, A, 1, cnt + (!p));
  if (tp) A[row]--;
  if (ans) Ans[row][col] = '*';
  if (ans) {
    return ans;
  }
  ans = Dfs(row + 1, col, mask, nmask, A, 0, cnt);
  return ans;
}
short Solve(int col, int mask, int A[]) {
  if (AA) return 1;
  if (col == m) {
    for (int i = 0; i < n; i++) {
      if (A[i] != a[i]) return 0;
    }
    AA = 1;
    return 1;
  }
  short &res = dp[col][mask][A[0]][A[1]][A[2]][A[3]][A[4]];
  if (res != -1) {
    return res;
  }
  for (int i = 0; i < n; i++) {
    if (A[i] > a[i]) return res = 0;
  }
  res = 0;
  for (int i = 0; i < Store[b[col]].size(); i++) {
    for (int j = 0; j < n; j++) {
      if (!Chkbit(mask, j) && Chkbit(Store[b[col]][i], j)) A[j]++;
    }
    res += Solve(col + 1, Store[b[col]][i], A);
    if (res) {
      for (int j = 0; j < n; j++) {
        if (Chkbit(Store[b[col]][i], j)) Ans[j][col] = '*';
      }
      return 1;
    }
    for (int j = 0; j < n; j++) {
      if (!Chkbit(mask, j) && Chkbit(Store[b[col]][i], j)) A[j]--;
    }
  }
  return res;
}
int A[6];
int CntBit(int mask) {
  int pv = 0, cnt = 0;
  for (int i = 0; i < n; i++) {
    if (Chkbit(mask, i)) {
      if (!pv) cnt++;
      pv = 1;
    } else
      pv = 0;
  }
  return cnt;
}
int main() {
  n = in<int>(), m = in<int>();
  for (int i = 0; i < n; i++) {
    a[i] = in<int>();
  }
  for (int i = 0; i < m; i++) {
    b[i] = in<int>();
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      Ans[i][j] = '.';
    }
  }
  for (int i = 0; i < (1 << n); i++) {
    Store[CntBit(i)].push_back(i);
  }
  memset(dp, -1, sizeof(dp));
  memset(A, 0, sizeof(A));
  int ans = Solve(0, 0, A);
  for (int i = 0; i < n; i++) {
    cout << Ans[i] << endl;
  }
  return 0;
}
