No tag edit access

E. Square Tiling

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou 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

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/22/2017 09:06:34 (c3).

Desktop version, switch to mobile version.

User lists

Name |
---|