#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int add(int a, int b) {
  long long x = a + b;
  if (x >= 1000000007) x -= 1000000007;
  if (x < 0) x += 1000000007;
  return x;
}
long long mul(long long a, long long b) { return (a * b) % 1000000007; }
long long pw(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed() {
  long long a = rng();
  return a;
}
int n, m;
char ans[102][102];
bool ch[28];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      if (ans[i][j] == NULL) {
        int mxsz = min(n - i + 1, m - j + 1);
        bool rau = 0;
        memset(ch, 0, sizeof(ch));
        for (int xx = i; xx <= n; ++xx)
          for (int yy = j; yy <= m; ++yy)
            if (ans[xx][yy] != NULL)
              mxsz = min(mxsz, min(xx - i + 1, yy - j + 1));
        int opt = 0, xx = 0;
        for (int pos = 1; pos <= mxsz; ++pos) {
          memset(ch, 0, sizeof(ch));
          for (int xx = j + pos - 1; xx <= j + pos - 1; ++xx) {
            if (ans[i - 1][xx] != NULL) ch[ans[i - 1][xx] - 'A'] = 1;
            if (ans[i + mxsz][xx] != NULL) ch[ans[i + mxsz][xx] - 'A'] = 1;
          }
          for (int xx = i + pos - 1; xx <= i + pos - 1; ++xx) {
            if (ans[xx][j - 1] != NULL) ch[ans[xx][j - 1] - 'A'] = 1;
            if (ans[xx][j + mxsz] != NULL) ch[ans[xx][j + mxsz] - 'A'] = 1;
          }
          int opz = 0;
          for (int q = 0; q <= 25; ++q)
            if (!ch[q]) {
              opz = q;
              break;
            }
          if (pos == 1)
            opt = opz, xx = pos;
          else if (opt == opz)
            ++xx;
          else
            break;
          if (pos == 1 && i == 1 && opt == 1) break;
          if (pos == 1 && opt >= 2) break;
        }
        for (int x = i; x <= i + xx - 1; ++x)
          for (int y = j; y <= j + xx - 1; ++y) ans[x][y] = 'A' + opt;
      }
  for (int i = 1; i <= n; cout << '\n', ++i)
    for (int j = 1; j <= m; ++j) cout << ans[i][j];
  return 0;
}
