Problem: Once Bob decided to lay a parquet floor in his living room. The living room is of size n × m metres. Bob had planks of three types: a planks 1 × 2 meters, b planks 2 × 1 meters, and c planks 2 × 2 meters. Help Bob find out, if it is possible to parquet the living room with such a set of planks, and if it is possible, find one of the possible ways to do so. Bob doesn't have to use all the planks.

Input

The first input line contains 5 space-separated integer numbers n, m, a, b, c (1 ≤ n, m ≤ 100, 0 ≤ a, b, c ≤ 104), n and m — the living room dimensions, a, b and c — amount of planks 1 × 2, 2 × 1 и 2 × 2 respectively. It's not allowed to turn the planks.

Output

If it is not possible to parquet the room with such a set of planks, output IMPOSSIBLE. Otherwise output one of the possible ways to parquet the room — output n lines with m lower-case Latin letters each. Two squares with common sides should contain the same letters, if they belong to one and the same plank, and different letters otherwise. Different planks can be marked with one and the same letter (see examples). If the answer is not unique, output any.

Examples

Input

2 6 2 2 1


Output

aabcca
aabdda


Input

1 1 100 100 100


Output

IMPOSSIBLE


Input

4 4 10 10 10


Output

aabb
aabb
bbaa
bbaa

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isPrime(T n) {
  if (n <= 1) return false;
  for (T i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
template <class T>
inline T Mod(T n, T m) {
  return (n % m + m) % m;
}
template <class T>
string toString(T n) {
  ostringstream oss;
  oss << n;
  oss.flush();
  return oss.str();
}
int toInt(string s) {
  int r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
long long toLl(string s) {
  long long r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
template <class T>
void debug(const T& e) {
  cout << e << endl;
}
template <class T1, class T2>
void debug(const T1& e1, const T2& e2) {
  cout << e1 << "\t" << e2 << endl;
}
template <class T1, class T2, class T3>
void debug(const T1& e1, const T2& e2, const T3& e3) {
  cout << e1 << "\t" << e2 << "\t" << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void debug(const T1& e1, const T2& e2, const T3& e3, const T4& e4) {
  cout << e1 << "\t" << e2 << "\t" << e3 << "\t" << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void debug(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
           const T5& e5) {
  cout << e1 << "\t" << e2 << "\t" << e3 << "\t" << e4 << "\t" << e5 << endl;
}
template <class T>
void debug(vector<T>& e) {
  int i;
  for (i = 0; i < (int)e.size(); i++) cout << e[i] << " ";
  cout << endl;
}
template <class T>
void debug(vector<basic_string<T> >& e) {
  int i, j;
  for (i = 0; i < (int)e.size(); i++) {
    for (j = 0; j < (int)e[i].size(); j++) cout << e[i][j];
    cout << endl;
  }
  cout << endl;
}
template <class T>
void debug(vector<vector<T> >& e) {
  int i, j;
  for (i = 0; i < (int)e.size(); i++) {
    for (j = 0; j < (int)e[i].size(); j++) cout << e[i][j] << "\t";
    cout << endl;
  }
  cout << endl;
}
template <class T>
void debug(T e[256][256], int row, int col) {
  int i, j;
  for (i = 0; i < row; i++) {
    for (j = 0; j < col; j++) cout << e[i][j] << " ";
    cout << endl;
  }
}
long long Pow(long long B, long long P) {
  long long R = 1;
  while (P > 0) {
    if (P % 2 == 1) R = (R * B);
    P /= 2;
    B = (B * B);
  }
  return R;
}
int n, m, a, b, c, row, col;
char color[110][110];
bool colo[130];
bool fill_row();
bool fill_col();
void fill_a(int i, int j);
void fill_b(int i, int j);
void fill_c(int i, int j);
bool valid(int i, int j);
int main() {
  int i, j, test, Case = 1, f;
  cin >> n >> m >> a >> b >> c;
  if (n % 2 && m % 2)
    printf("IMPOSSIBLE\n");
  else {
    memset(color, 'z', sizeof(color));
    row = n;
    col = m;
    if (n % 2) {
      if (!fill_row()) {
        printf("IMPOSSIBLE\n");
        return 0;
      }
      row--;
    }
    if (m % 2) {
      if (!fill_col()) {
        printf("IMPOSSIBLE\n");
        return 0;
      }
      col--;
    }
    f = 0;
    for (i = 0; i < row; i++)
      for (j = 0; j < col; j++)
        if (color[i][j] == 'z') {
          if (c > 0) {
            fill_c(i, j);
          } else if (a > 1) {
            fill_a(i, j);
            fill_a(i + 1, j);
          } else if (b > 1) {
            fill_b(i, j);
            fill_b(i, j + 1);
          } else {
            f = 1;
            goto ab;
          }
        }
  ab:;
    if (f)
      printf("IMPOSSIBLE\n");
    else {
      for (i = 0; i < n; i++) {
        color[i][m] = 0;
        printf("%s\n", color[i]);
      }
    }
  }
  return 0;
}
bool fill_row() {
  int i, j;
  if (m / 2 > a) return false;
  a = a - (m / 2);
  for (i = 0; i < m; i += 4)
    for (j = 0; j < 2; j++) color[n - 1][i + j] = 'x';
  for (i = 2; i < m; i += 4)
    for (j = 0; j < 2; j++) color[n - 1][i + j] = 'y';
  return true;
}
bool fill_col() {
  int i, j;
  if (n / 2 > b) return false;
  b = b - (n / 2);
  for (i = 0; i < n; i += 4)
    for (j = 0; j < 2; j++) color[i + j][m - 1] = 'x';
  for (i = 2; i < n; i += 4)
    for (j = 0; j < 2; j++) color[i + j][m - 1] = 'y';
  return true;
}
void fill_a(int i, int j) {
  int p, q;
  char ch;
  memset(colo, false, sizeof(colo));
  if (valid(i - 1, j)) colo[color[i - 1][j]] = true;
  if (valid(i - 1, j + 1)) colo[color[i - 1][j + 1]] = true;
  if (valid(i, j - 1)) colo[color[i][j - 1]] = true;
  for (p = 'a';; p++)
    if (colo[p] == false) {
      ch = p;
      break;
    }
  for (p = 0; p < 1; p++)
    for (q = 0; q < 2; q++) color[i + p][j + q] = ch;
  a--;
  return;
}
void fill_b(int i, int j) {
  int p, q;
  char ch;
  memset(colo, false, sizeof(colo));
  if (valid(i - 1, j)) colo[color[i - 1][j]] = true;
  if (valid(i, j - 1)) colo[color[i][j - 1]] = true;
  if (valid(i + 1, j - 1)) colo[color[i + 1][j - 1]] = true;
  for (p = 'a';; p++)
    if (colo[p] == false) {
      ch = p;
      break;
    }
  for (p = 0; p < 2; p++)
    for (q = 0; q < 1; q++) color[i + p][j + q] = ch;
  b--;
  return;
}
void fill_c(int i, int j) {
  int p, q;
  char ch;
  memset(colo, false, sizeof(colo));
  if (valid(i - 1, j)) colo[color[i - 1][j]] = true;
  if (valid(i - 1, j + 1)) colo[color[i - 1][j + 1]] = true;
  if (valid(i, j - 1)) colo[color[i][j - 1]] = true;
  if (valid(i + 1, j - 1)) colo[color[i + 1][j - 1]] = true;
  for (p = 'a';; p++)
    if (colo[p] == false) {
      ch = p;
      break;
    }
  for (p = 0; p < 2; p++)
    for (q = 0; q < 2; q++) color[i + p][j + q] = ch;
  c--;
  return;
}
bool valid(int i, int j) {
  if (i < 0 || j < 0 || i >= row || j >= col) return false;
  return true;
}