Problem:
Score : 500 points

Problem Statement

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:

Let the size of the grid be h \times w (h vertical, w horizontal). Both h and w are at most 100.

The set of the squares painted white is divided into exactly A connected components.

The set of the squares painted black is divided into exactly B connected components.

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.

Notes

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:

Any two squares in S are connected.

No pair of a square painted white that is not included in S and a square included in S is connected.

A connected component of squares painted black is defined similarly.

Constraints

1 \leq A \leq 500

1 \leq B \leq 500

Input

Input is given from Standard Input in the following format:

A B

Output

Output should be in the following format:

In the first line, print integers h and w representing the size of the grid you constructed, with a space in between.

Then, print h more lines. The i-th (1 \leq i \leq h) of these lines should contain a string s_i as follows:

If the square at the i-th row and j-th column (1 \leq j \leq w) in the grid is painted white, the j-th character in s_i should be ..

If the square at the i-th row and j-th column (1 \leq j \leq w) in the grid is painted black, the j-th character in s_i should be #.

Sample Input 1

2 3

Sample Output 1

3 3
##.
..#
#.#

This output corresponds to the grid below:

Sample Input 2

7 8

Sample Output 2

3 5
#.#.#
.#.#.
#.#.#

Sample Input 3

1 1

Sample Output 3

4 2
..
#.
##
##

Sample Input 4

3 14

Sample Output 4

8 18
..................
..................
....##.......####.
....#.#.....#.....
...#...#....#.....
..#.###.#...#.....
.#.......#..#.....
#.........#..####.

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

a, b = gets.strip.split.map(&:to_i)

# 白のほうが多いと仮定する。全部を白で塗っておく
table = []
100.times do
  table << "." * 99
end

# 黒の連結成分をを B - 1 個作る
# 1行に50個作れるので　必要な行数 = ((B - 1) + 49) / 50
black_lines = ((b - 1) + 49) / 50

# 黒に塗っていく
(b - 1).times do |i|
  row = (i / 50) * 2
  col = (i - (i / 50) * 50) * 2
  # puts "i = #{i}, row = #{row}, col = #{col}"
  table[row][col] = '#'
end

# 残りで白の連結成分を作る
# 黒で塗られているところは高々10行目までしか来ないので
# 下から80行の間でなんとかする
white = a
line = 98
#黒の最後の連結成分を作成
(20...100).each do |i|
  table[i][0] = '#'
end

while line >= 20 do
  if white <= 0
    break
  end
  # 黒で塗りつぶす
  table[line] = "#" * 99
  line -= 2
  white -= 1
end

# まだ白の連結成分が足りない場合
# puts "white = #{white}"
if white > 0
  line = 99
  col = 2
  while white > 0
    # puts "aaaaaaaaaaaa"
    table[line][col] = '#'
    col += 2
    if col >= 99
      col = 2
      line -= 2
    end
    white -= 1
  end
end

def print_table(table)
  100.times do |i|
    puts table[i]
  end
end

print_table(table)