#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int n, m;
int dx[4] = {1, -1}, dy[4] = {0, 0, 1, -1};
char a[MAXN][MAXN];
int Read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x * 10) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
void Put1(int x) {
  if (x > 9) Put1(x / 10);
  putchar(x % 10 ^ 48);
}
void Put(int x, char c = -1) {
  if (x < 0) putchar('-'), x = -x;
  Put1(x);
  if (c >= 0) putchar(c);
}
template <typename T>
T Max(T x, T y) {
  return x > y ? x : y;
}
template <typename T>
T Min(T x, T y) {
  return x < y ? x : y;
}
template <typename T>
T Abs(T x) {
  return x < 0 ? -x : x;
}
char findls(int x, int y) {
  bool vis[4] = {};
  for (int i = 0; i < 4; ++i) {
    int tox = x + dx[i], toy = y + dy[i];
    if (tox >= 1 && toy >= 1 && tox <= n && toy <= m && a[tox][toy])
      vis[a[tox][toy] - 'A'] = 1;
  }
  for (int i = 0; i < 4; ++i)
    if (!vis[i]) return i + 'A';
}
bool scheck(int x, int y, char C) {
  for (int i = 0; i < 4; ++i) {
    int tox = x + dx[i], toy = y + dy[i];
    if (tox >= 1 && toy >= 1 && tox <= n && toy <= m && a[tox][toy] == C)
      return 0;
  }
  return 1;
}
bool check(int x, int y, int len, char C) {
  for (int i = x; i <= x + len; ++i)
    if (a[i][y + len] || !scheck(i, y + len, C)) return 0;
  for (int i = y; i <= y + len; ++i)
    if (a[x + len][i] || !scheck(x + len, i, C)) return 0;
  return 1;
}
void solve(int x, int y, char C) {
  for (int len = 0;; ++len) {
    if (x + len > n || y + len > m || !check(x, y, len, C)) {
      len--;
      for (int i = x; i <= x + len; ++i)
        for (int j = y; j <= y + len; ++j) a[i][j] = C;
      return;
    }
  }
}
int main() {
  n = Read();
  m = Read();
  for (int i = 1; i <= n; ++i, putchar('\n'))
    for (int j = 1; j <= m; ++j) {
      if (!a[i][j]) {
        char c = findls(i, j);
        if ((a[i][j - 1] == 'A' && c == 'B' && i == 1) || c >= 'C')
          a[i][j] = c;
        else
          solve(i, j, c);
      }
      putchar(a[i][j]);
    }
  return 0;
}
