Score : $500$ points
You are given two integers $A$ and $B$.
Print a grid where each square is painted white or black that satisfies the following conditions, in the format specified in Output section:
It can be proved that there always exist one or more solutions under the conditions specified in Constraints section. If there are multiple solutions, any of them may be printed.
Two squares painted white, $c_1$ and $c_2$, are called connected when the square $c_2$ can be reached from the square $c_1$ passing only white squares by repeatedly moving up, down, left or right to an adjacent square.
A set of squares painted white, $S$, forms a connected component when the following conditions are met:
A connected component of squares painted black is defined similarly.
Input is given from Standard Input in the following format:
$A$ $B$
Output should be in the following format:
.
.#
.2 3
3 3 ##. ..# #.#
This output corresponds to the grid below:
7 8
3 5 #.#.# .#.#. #.#.#
1 1
4 2 .. #. ## ##
3 14
8 18 .................. .................. ....##.......####. ....#.#.....#..... ...#...#....#..... ..#.###.#...#..... .#.......#..#..... #.........#..####.