#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int N = 1e2 + 10;
const int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
int n, m, ans[N][N];
void build(int x, int y) {
  if (x > n) return;
  if (y > m) {
    build(x + 1, 1);
    return;
  }
  if (ans[x][y] == -1) {
    int use = 0;
    for (auto to = 1; to <= 4; to++) {
      for (auto k = 0; k <= 3; k++) {
        int nx = x + dx[k], ny = y + dy[k];
        if (ans[nx][ny] == use) {
          use++;
          break;
        }
      }
      if (use < to) break;
    }
    int edge = 1;
    if (use < 2) {
      while (y + edge <= m && x + edge <= n && ans[x][y + edge] == -1) {
        if (!use) {
          if (ans[x - 1][y + edge] == 0)
            break;
          else
            edge++;
        } else {
          if (ans[x - 1][y + edge])
            break;
          else
            edge++;
        }
      }
    }
    for (auto i = 0; i < edge; i++)
      for (auto j = 0; j < edge; j++) ans[x + i][y + j] = use;
  }
  build(x, y + 1);
}
int main() {
  scanf("%d%d", &n, &m);
  memset(ans, -1, sizeof(ans));
  build(1, 1);
  for (auto i = 1; i <= n; i++) {
    for (auto j = 1; j <= m; j++) printf("%c", 'A' + ans[i][j]);
    printf("\n");
  }
}
