Problem: A revolution took place on the Buka Island. New government replaced the old one. The new government includes n parties and each of them is entitled to some part of the island according to their contribution to the revolution. However, they can't divide the island.

The island can be conventionally represented as two rectangles a × b and c × d unit squares in size correspondingly. The rectangles are located close to each other. At that, one of the sides with the length of a and one of the sides with the length of c lie on one line. You can see this in more details on the picture.

<image>

The i-th party is entitled to a part of the island equal to xi unit squares. Every such part should fully cover several squares of the island (it is not allowed to cover the squares partially) and be a connected figure. A "connected figure" presupposes that from any square of this party one can move to any other square of the same party moving through edge-adjacent squares also belonging to that party.

Your task is to divide the island between parties.

Input

The first line contains 5 space-separated integers — a, b, c, d and n (1 ≤ a, b, c, d ≤ 50, b ≠ d, 1 ≤ n ≤ 26). The second line contains n space-separated numbers. The i-th of them is equal to number xi (1 ≤ xi ≤ a × b + c × d). It is guaranteed that <image>.

Output

If dividing the island between parties in the required manner is impossible, print "NO" (without the quotes). Otherwise, print "YES" (also without the quotes) and, starting from the next line, print max(b, d) lines each containing a + c characters. To mark what square should belong to what party, use lowercase Latin letters. For the party that is first in order in the input data, use "a", for the second one use "b" and so on. Use "." for the squares that belong to the sea. The first symbol of the second line of the output data should correspond to the square that belongs to the rectangle a × b. The last symbol of the second line should correspond to the square that belongs to the rectangle c × d.

If there are several solutions output any.

Examples

Input

3 4 2 2 3
5 8 3


Output

YES
aaabb
aabbb
cbb..
ccb..


Input

3 2 1 4 4
1 2 3 4


Output

YES
abbd
cccd
...d
...d

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int area[100];
char Map[100][100];
int main() {
  int i, j;
  int a, b, c, d, n;
  while (scanf("%d%d%d%d%d", &a, &b, &c, &d, &n) != EOF) {
    for (i = 1; i <= n; i++) scanf("%d", &area[i]);
    int p = 1;
    char cc = 'a';
    if (b > d) {
      for (i = d + 1; i <= b; i++)
        for (j = a + 1; j <= a + c; j++) Map[i][j] = '.';
      for (i = b; i > d; i--) {
        if ((i - d) % 2 == 0) {
          for (j = 1; j <= a; j++) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        } else {
          for (j = a; j >= 1; j--) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        }
      }
      for (i = d; i >= 0; i--) {
        if ((d - i) % 2 == 0) {
          for (j = 1; j <= a + c; j++) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        } else {
          for (j = a + c; j >= 1; j--) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        }
      }
    } else {
      for (i = b + 1; i <= d; i++)
        for (j = 1; j <= a; j++) Map[i][j] = '.';
      for (i = d; i > b; i--) {
        if ((i - d) % 2 == 0) {
          for (j = a + c; j > a; j--) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        } else {
          for (j = a + 1; j <= a + c; j++) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        }
      }
      for (i = b; i >= 1; i--) {
        if ((b - i) % 2 == 0) {
          for (j = a + c; j >= 1; j--) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        } else {
          for (j = 1; j <= a + c; j++) {
            if (area[p] == 0) {
              p++;
              cc = cc + 1;
            }
            area[p]--;
            Map[i][j] = cc;
          }
        }
      }
    }
    b = max(b, d);
    a = a + c;
    printf("YES\n");
    for (i = 1; i <= b; i++) {
      for (j = 1; j <= a; j++) {
        printf("%c", Map[i][j]);
        if (j == a) printf("\n");
      }
    }
  }
  return 0;
}