#include <bits/stdc++.h>
using namespace std;
const int N = 111;
int n, m;
char M[N][N];
int check(int i, int j, int k = 0) {
  int st[5] = {0};
  st[M[i - 1][j]] = 1;
  st[M[i][j - 1]] = 1;
  st[M[i][j + 1]] = 1;
  st[k] = 0;
  for (int u = 1; u <= 4; ++u)
    if (st[u] == 0) return u;
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      if (M[i][j]) continue;
      int col = check(i, j);
      int k;
      for (k = 1; i + k <= n && j + k <= m; ++k) {
        if (M[i][j + k] == 0 && M[i + k][j] == 0 &&
            check(i, j + k, M[i][j + k - 1]) == col) {
          M[i][j + k] = M[i + k][j] = col;
        } else
          break;
      }
      --k;
      for (int u = i; u <= i + k; ++u) {
        for (int v = j; v <= j + k; ++v) {
          M[u][v] = col;
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i, printf("\n")) {
    for (int j = 1; j <= m; ++j) {
      printf("%c", 'A' + M[i][j] - 1);
    }
  }
  return 0;
}
