#include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
long long powmod(long long a, long long b) {
  long long tmp = 1;
  a %= (1000000007);
  for (; b; b >>= 1) {
    if (b & 1) tmp = tmp * a % (1000000007);
    a = a * a % (1000000007);
  }
  return tmp;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <class T>
inline void R(T &xx) {
  xx = 0;
  char ch = getchar();
  bool F = 0;
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') F = 1, ch = getchar();
  while (ch >= '0' && ch <= '9')
    xx = xx + xx + (xx << 3) + ch - 48, ch = getchar();
  if (F) xx = -xx;
}
template <class T>
inline void add(int &x, T y) {
  for (x += y; x >= (1000000007); x -= (1000000007))
    ;
}
int A[1011][1011], tmp[27];
int n, m;
inline int getMin(int x, int y) {
  if (A[x][y]) return A[x][y];
  for (int i = 'A';; i++)
    if (A[x][y - 1] != i && A[x][y + 1] != i && A[x - 1][y] != i &&
        A[x + 1][y] != i)
      return i;
}
int main() {
  R(n), R(m);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      int k = 0, t;
      putchar(t = getMin(i, j));
      if (A[i][j]) continue;
      while (i + k <= n && j + k <= m && getMin(i, j + k) == t) k++;
      for (int l = i; l < i + k; l++)
        for (int m = j; m < j + k; m++) A[l][m] = t;
    }
    puts("");
  }
}
