You have an n × m rectangle table, its cells are not initially painted. Your task is to paint all cells of the table. The resulting picture should be a tiling of the table with squares. More formally:

  * each cell must be painted some color (the colors are marked by uppercase Latin letters); 
  * we will assume that two cells of the table are connected if they are of the same color and share a side; each connected region of the table must form a square. 



Given n and m, find lexicographically minimum coloring of the table that meets the described properties.

Input

The first line contains two integers, n and m (1 ≤ n, m ≤ 100).

Output

Print lexicographically minimum coloring of the table that meets the described conditions. 

One coloring (let's call it X) is considered lexicographically less than the other one (let's call it Y), if:

  * consider all the table cells from left to right and from top to bottom (first, the first cell in the first row, then the second cell in the first row and so on); 
  * let's find in this order the first cell that has distinct colors in two colorings; 
  * the letter that marks the color of the cell in X, goes alphabetically before the letter that marks the color of the cell in Y. 

Examples

Input

1 3


Output

ABA


Input

2 2


Output

AA
AA


Input

3 4


Output

AAAB
AAAC
AAAB
import java.io.*;
import java.lang.*;
import java.util.*;


public class Main {
  public static void main(String[] args) throws IOException {
    InputReader reader = new InputReader(System.in);
    PrintWriter writer = new PrintWriter(System.out, true);
    try {
      Task task = new Task();
      task.solve(reader, writer);
    } finally {
      reader.close();
      writer.close();
    }
  }
}

class Task {
  public int getLowestRank(int i, int j, int[][] matrix) {
    int maxRank = 0;

    maxRank = Math.max(matrix[i-1][j], matrix[i][j-1]);
    maxRank = Math.max(maxRank, matrix[i][j+1]);

    for (int x = 1; x < maxRank; x++) {
      if (x != matrix[i-1][j] && x != matrix[i][j-1] && x != matrix[i][j+1]) {
        return x;
      }
    }
    return maxRank+1;
  }


  private void printMatrix(int n, int m, int[][] matrix, PrintWriter writer) {
    for (int i=1; i<=n; i++) {
      for (int j=1; j<=m; j++) {
        writer.print((char)(matrix[i][j] + 'A' - 1));
      }
      writer.println();
    }
  }

  public boolean canDraw(int i, int j, int[][] matrix, int rect, int rectRank) {
    if (0 != matrix[i][j+rect]) {
      return false;
    }

    int rank = getLowestRank(i, j + rect, matrix);
    if (rank < rectRank || rectRank == matrix[i-1][j + rect]) {
      return false;
    }

    return true;
  }

  public void solve(InputReader reader, PrintWriter writer) throws IOException {
    int n = reader.nextInt();
    int m = reader.nextInt();

    int[][] matrix = new int[n+2][m+2];
    int currentRect = 0;

    for (int i = 1; i <= n; i++) {
      for (int j=1; j <= m; j++) {
        if (0 != matrix[i][j]) continue;
        int rectSize = 0;

        int rank = getLowestRank(i, j, matrix);

        while (rectSize < Math.min(n - i + 1, m - j + 1) && canDraw(i, j, matrix, rectSize, rank)) {
          rectSize++;
        }

        for (int ki = i; ki < i+rectSize; ki++) {
          for (int kj = j; kj < j+rectSize; kj++) {
            matrix[ki][kj] = rank;
          }
        }
      }
    }

    printMatrix(n, m, matrix, writer);
  }
}

class InputReader {
  private StringTokenizer tokenizer;
  private BufferedReader reader;

  InputReader(InputStream stream) {
    this.reader = new BufferedReader(new InputStreamReader(stream));
  }

  public String nextToken() throws IOException {
    while (null == tokenizer || !tokenizer.hasMoreTokens()) {
      this.tokenizer = new StringTokenizer(reader.readLine());
    }
    return this.tokenizer.nextToken();
  }

  public int nextInt() throws IOException {
    return Integer.parseInt(nextToken());
  }
  public void close() throws IOException{
    this.reader.close();
  }
}


