#include <bits/stdc++.h>
using namespace std;
int a[105][105], b, c, d, e, f, g, h, i, j, k, l, m, n;
inline bool pd(int x, int y, int s) {
  return a[x - 1][y] == s || a[x + 1][y] == s || a[x][y - 1] == s ||
         a[x][y + 1] == s;
}
int main() {
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++)
    for (j = 1; j <= m; j++)
      if (!a[i][j]) {
        if (i == 3 && j == 21) {
          k = 1;
        }
        for (k = 1; k <= 26; k++)
          if (!pd(i, j, k)) {
            for (l = 1; l <= n; l++) {
              if (i + l > n || j + l > m) break;
              d = 0;
              for (g = j; g <= j + l; g++)
                if (a[i + l][g] || pd(i + l, g, k)) {
                  d = 1;
                  break;
                }
              if (d) break;
              for (g = i; g <= i + l; g++)
                if (a[g][j + l] || pd(g, j + l, k)) {
                  d = 1;
                  break;
                }
              if (d) break;
              for (g = 1; g < k; g++)
                if (!pd(i, j + l, g)) d = 1;
              if (d) break;
            }
            l--;
            for (d = i; d <= i + l; d++)
              for (e = j; e <= j + l; e++) a[d][e] = k;
            break;
          }
      }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) putchar(a[i][j] + 'A' - 1);
    printf("\n");
  }
  return 0;
}
