#include <bits/stdc++.h>
using namespace std;
int n, m;
char c[111][111];
void f(int y, int x) {
  char cl = 'A';
  while (cl == c[y - 1][x] || cl == c[y][x - 1] || cl == c[y][x + 1] ||
         cl == c[y + 1][x])
    cl++;
  if (cl == 'A') {
    int l = 1;
    while (l < min(n + 1 - y, m + 1 - x) && c[y][x + l] == 0 &&
           c[y - 1][x + l] != cl)
      l++;
    for (int i = y; i < (y + l); i++)
      for (int j = x; j < (x + l); j++) {
        c[i][j] = cl;
      }
  } else if (cl == 'B') {
    int l = 1;
    while (l < min(n + 1 - y, m + 1 - x) && c[y][x + l] == 0 &&
           c[y - 1][x + l] != cl && c[y - 1][x + l] == 'A')
      l++;
    for (int i = y; i < (y + l); i++)
      for (int j = x; j < (x + l); j++) {
        c[i][j] = cl;
      }
  } else
    c[y][x] = cl;
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i < (n + 1); i++)
    for (int j = 1; j < (m + 1); j++)
      if (c[i][j] == 0) f(i, j);
  for (int i = 1; i < (n + 1); i++) cout << c[i] + 1 << endl;
}
