#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int inf = 1e9;
int mod = 1e9 + 7;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  int a, b, c;
  cin >> a >> b >> c;
  int ans[2 * n][2 * m];
  int tile[n][m];
  memset(tile, -1, sizeof(tile));
  int lastx = -1, lasty = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (!a) break;
      tile[i][j] = 0;
      lastx = i;
      lasty = j;
      a--;
    }
    if (!a) break;
  }
  if (lastx != -1 && lasty != -1) {
    lastx++;
    int val[2];
    val[0] = 5;
    val[1] = 4;
    if (lasty % 2) swap(val[0], val[1]);
    for (int j = 0; j <= lasty; j++) {
      tile[lastx][j] = val[j % 2];
      c--;
    }
    lastx--;
    val[0] = 5;
    val[1] = 4;
    for (int j = lasty + 1, k = 0; j < m; j++, k = 1 - k) {
      tile[lastx][j] = val[k];
      c--;
    }
  }
  lastx = -1;
  lasty = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (tile[i][j] == -1) {
        if (!b) break;
        tile[i][j] = 1;
        b--;
        lastx = i;
        lasty = j;
      }
    }
    if (!b) break;
  }
  vector<bool> left(6, false), down(6, false);
  left[0] = left[2] = left[3] = true;
  down[0] = down[3] = down[4] = true;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (tile[i][j] == -1) {
        if (i && j) {
          if (left[tile[i - 1][j]] && down[tile[i][j - 1]])
            tile[i][j] = 5;
          else if (left[tile[i - 1][j]] && !down[tile[i][j - 1]])
            tile[i][j] = 4;
          else if (!left[tile[i - 1][j]] && down[tile[i][j - 1]])
            tile[i][j] = 2;
          else
            tile[i][j] = 3;
        } else if (!i && j) {
          if (down[tile[i][j - 1]])
            tile[i][j] = 2;
          else
            tile[i][j] = 3;
        } else if (i) {
          if (left[tile[i - 1][j]])
            tile[i][j] = 6;
          else
            tile[i][j] = 3;
        } else
          tile[i][j] = 2;
        c--;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (tile[i][j] == 0) {
        ans[2 * i][2 * j] = 1;
        ans[2 * i][2 * j + 1] = 1;
        ans[2 * i + 1][2 * j] = 1;
        ans[2 * i + 1][2 * j + 1] = 1;
      } else if (tile[i][j] == 1) {
        ans[2 * i][2 * j] = 0;
        ans[2 * i][2 * j + 1] = 0;
        ans[2 * i + 1][2 * j] = 0;
        ans[2 * i + 1][2 * j + 1] = 0;
      } else if (tile[i][j] == 2) {
        ans[2 * i][2 * j] = 2;
        ans[2 * i][2 * j + 1] = 0;
        ans[2 * i + 1][2 * j] = 1;
        ans[2 * i + 1][2 * j + 1] = 2;
      } else if (tile[i][j] == 3) {
        ans[2 * i][2 * j] = 0;
        ans[2 * i][2 * j + 1] = 3;
        ans[2 * i + 1][2 * j] = 3;
        ans[2 * i + 1][2 * j + 1] = 1;
      } else if (tile[i][j] == 4) {
        ans[2 * i][2 * j] = 2;
        ans[2 * i][2 * j + 1] = 1;
        ans[2 * i + 1][2 * j] = 0;
        ans[2 * i + 1][2 * j + 1] = 2;
      } else {
        ans[2 * i][2 * j] = 1;
        ans[2 * i][2 * j + 1] = 3;
        ans[2 * i + 1][2 * j] = 3;
        ans[2 * i + 1][2 * j + 1] = 0;
      }
    }
  }
  for (int i = 0; i < 2 * n; i++) {
    for (int j = 0; j < 2 * m; j++) {
      if (ans[i][j] == 0)
        cout << ".";
      else if (ans[i][j] == 1)
        cout << "#";
      else if (ans[i][j] == 2)
        cout << "\\";
      else
        cout << "/";
    }
    cout << "\n";
  }
  cout << "\n";
  return 0;
}
