#include <bits/stdc++.h>
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
const int MAXN = 210;
int n, m, a, b, c, ans[MAXN][MAXN], col[MAXN][4];
inline bool valid(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; }
void get(int x, int y) {
  for (int now = 2; now < 6; now++) {
    bool yes = true;
    for (int k = 0; k < 4; k++) {
      int xx = x + dx[k], yy = y + dy[k];
      if (!valid(xx, yy)) continue;
      if (ans[xx][yy] == -1) continue;
      if (col[now][k] != col[ans[xx][yy]][(k + 2) % 4]) {
        yes = false;
        break;
      }
    }
    if (yes) {
      ans[x][y] = now;
      return;
    }
  }
  throw 1;
}
int main() {
  col[0][0] = col[0][1] = col[0][2] = col[0][3] = 1;
  col[1][0] = col[1][1] = col[1][2] = col[1][3] = 0;
  col[2][0] = col[2][1] = 1, col[2][2] = col[2][3] = 0;
  col[3][0] = col[3][3] = 0, col[3][1] = col[3][2] = 1;
  col[4][0] = col[4][1] = 0, col[4][2] = col[4][3] = 1;
  col[5][0] = col[5][3] = 1, col[5][1] = col[5][2] = 0;
  scanf("%d %d", &n, &m);
  scanf("%d %d %d", &a, &b, &c);
  int N = 0;
  for (int i = 0; i < a; i++) {
    ans[N / m][N % m] = 0;
    N++;
  }
  for (int i = 0; i < m; i++) {
    ans[N / m][N % m] = -1;
    N++;
  }
  c -= m;
  for (int i = 0; i < b; i++) {
    ans[N / m][N % m] = 1;
    N++;
  }
  for (int i = 0; i < c; i++) {
    ans[N / m][N % m] = -1;
    N++;
  }
  int x = (a - 1) / m + 1, y = (a - 1) % m;
  if (a > 0)
    for (int j = y; j >= 0; j--) get(x, j);
  if (a > 0)
    for (int j = y + 1; j < m; j++) get(x - 1, j);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (ans[i][j] == -1) {
        get(i, j);
      }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      switch (ans[i][j]) {
        case 0:
          putchar('#');
          putchar('#');
          break;
        case 1:
          putchar('.');
          putchar('.');
          break;
        case 2:
          putchar('\\');
          putchar('#');
          break;
        case 3:
          putchar('.');
          putchar('/');
          break;
        case 4:
          putchar('\\');
          putchar('.');
          break;
        case 5:
          putchar('#');
          putchar('/');
          break;
      }
    }
    puts("");
    for (int j = 0; j < m; j++) {
      switch (ans[i][j]) {
        case 0:
          putchar('#');
          putchar('#');
          break;
        case 1:
          putchar('.');
          putchar('.');
          break;
        case 2:
          putchar('.');
          putchar('\\');
          break;
        case 3:
          putchar('/');
          putchar('#');
          break;
        case 4:
          putchar('#');
          putchar('\\');
          break;
        case 5:
          putchar('/');
          putchar('.');
          break;
      }
    }
    puts("");
  }
  return 0;
}
