|Codeforces Round #246 (Div. 2)|
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:
Given n and m, find lexicographically minimum coloring of the table that meets the described properties.
The first line contains two integers, n and m (1 ≤ n, m ≤ 100).
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: