#include <bits/stdc++.h>
using namespace std;
int n, m, k;
bool debug = false;
int mp[205][205];
int d[205][205], r[205][205];
void p() {
  char c[2 * 205][2 * 205];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      int ii = 2 * i, jj = 2 * j;
      if (mp[i][j] == 1)
        c[ii][jj] = c[ii + 1][jj] = c[ii][jj + 1] = c[ii + 1][jj + 1] = '#';
      else if (mp[i][j] == 3) {
        c[ii][jj] = '\\';
        c[ii][jj + 1] = '#';
        c[ii + 1][jj] = '.';
        c[ii + 1][jj + 1] = '\\';
      } else if (mp[i][j] == 4) {
        c[ii][jj] = '.';
        c[ii][jj + 1] = '/';
        c[ii + 1][jj] = '/';
        c[ii + 1][jj + 1] = '#';
      } else if (mp[i][j] == 5) {
        c[ii][jj] = '\\';
        c[ii][jj + 1] = '.';
        c[ii + 1][jj] = '#';
        c[ii + 1][jj + 1] = '\\';
      } else if (mp[i][j] == 6) {
        c[ii][jj] = '#';
        c[ii][jj + 1] = '/';
        c[ii + 1][jj] = '/';
        c[ii + 1][jj + 1] = '.';
      } else {
        c[ii][jj] = c[ii + 1][jj] = c[ii][jj + 1] = c[ii + 1][jj + 1] = '.';
      }
    }
  for (int i = 0; i < 2 * n; i++) {
    puts(c[i]);
  }
}
void build(int x, int y, int xx) {
  bool up = (x == 0 || d[x - 1][y]), left = (y == 0 || r[x][y - 1]);
  if (y == 0 && xx % 2 == 0) left = false;
  if (up && left) mp[x][y] = 6;
  if (up && !left) mp[x][y] = 3;
  if (!up && left) mp[x][y] = 5;
  if (!up && !left) mp[x][y] = 4;
  d[x][y] = !up;
  r[x][y] = !left;
}
int main() {
  scanf("%d%d", &n, &m);
  int a, b, c;
  scanf("%d%d%d", &a, &b, &c);
  int cou = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (cou < a) {
        mp[i][j] = 1;
        d[i][j] = r[i][j] = 1;
      } else if (cou < a + m) {
        build(i, j, a + m - cou);
      } else if (cou < a + m + b) {
        mp[i][j] = 2;
      } else {
        build(i, j, 1);
      }
      cou++;
    }
  p();
  return 0;
}
