#include <bits/stdc++.h>
int a[300][300], n, m, i, j, k, c, x, y;
int ch(int i, int j) {
  int c = 1;
  while ((i && a[i - 1][j] == c) || (j && a[i][j - 1] == c) ||
         (j < m && a[i][j + 1] == c))
    ++c;
  return c;
}
bool chc(int i, int j, int c) {
  return ((i && a[i - 1][j] == c) || (j && a[i][j - 1] == c) ||
          (j < m && a[i][j + 1] == c));
}
int main() {
  scanf("%d%d", &n, &m);
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++)
      if (!a[i][j]) {
        k = n - i < m - j ? n - i : m - j;
        c = ch(i, j);
        for (x = 0; x < k; x++)
          if (a[i][j + x] || ch(i, j + x) < c) {
            k = x;
            break;
          }
        for (x = 1; x < k; x++)
          if (ch(i, j + x) != c) k = x - 1;
        for (x = 1; x < k; x++)
          if (chc(i + x, j, c)) k = x - 1;
        for (x = 0; x < k; x++)
          for (y = 0; y < k; y++) a[i + x][j + y] = c;
        a[i][j] = c;
      }
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) putchar(a[i][j] + 64);
    printf("\n");
  }
  return 0;
}
