#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <typename T>
T gcd(T a, T b) {
  return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
template <typename T>
T mod_exp(T b, T p, T m) {
  T x = 1;
  while (p) {
    if (p & 1) x = (x * b) % m;
    b = (b * b) % m;
    p = p >> 1;
  }
  return x;
}
template <typename T>
T invFermat(T a, T p) {
  return mod_exp(a, p - 2, p);
}
template <typename T>
T exp(T b, T p) {
  T x = 1;
  while (p) {
    if (p & 1) x = (x * b);
    b = (b * b);
    p = p >> 1;
  }
  return x;
}
string tostring(int number) {
  stringstream ss;
  ss << number;
  return ss.str();
}
int mpow(int base, int exp) {
  base %= MOD;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long int)result * base) % MOD;
    base = ((long long int)base * base) % MOD;
    exp >>= 1;
  }
  return result;
}
const int maxm = 1e6 + 1;
vector<bool> is_prime(maxm, true);
void sieve() {
  is_prime[0] = is_prime[1] = false;
  for (int i = 2; i * i <= maxm; i++) {
    if (is_prime[i]) {
      for (int j = i * i; j <= maxm; j += i) is_prime[j] = false;
    }
  }
}
void sol() {
  int n, a, b, c, d, temp;
  cin >> a >> b >> c >> d >> n;
  deque<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  char party = 'a';
  char ans[max(b, d)][a + c];
  int co = 0, r = 0, inc = 1;
  if (a & 1) {
    co = 0, r = max(b, d) - 1, inc = -1;
  }
  while (co < a + c) {
    while (r >= 0 && r < max(b, d)) {
      if (b < d && co < a && r >= b) {
        ans[r][co] = '.';
      } else if (b > d && co >= a && r >= d) {
        ans[r][co] = '.';
      } else {
        if (v.front() == 0) {
          v.pop_front();
          party++;
        }
        ans[r][co] = party;
        v.front()--;
      }
      r += inc;
    }
    if (r < 0) {
      r = 0, inc = 1;
    } else {
      r = max(b, d) - 1, inc = -1;
    }
    co++;
  }
  cout << "YES" << endl;
  for (int i = 0; i < max(b, d); i++) {
    for (int j = 0; j < a + c; j++) {
      cout << ans[i][j];
    }
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) {
    sol();
  }
  return 0;
}
