output_description: 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 `#`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: import sys
  import math
  import copy
  import random
  from heapq import heappush, heappop, heapify
  from functools import cmp_to_key
  from bisect import bisect_left, bisect_right
  from collections import defaultdict, deque, Counter
  
  # sys.setrecursionlimit(1000000)
  
  # input aliases
  input = sys.stdin.readline
  getS = lambda: input().strip()
  getN = lambda: int(input())
  getList = lambda: list(map(int, input().split()))
  getZList = lambda: [int(x) - 1 for x in input().split()]
  
  INF = float("inf")
  MOD = 10**9 + 7
  divide = lambda x: pow(x, MOD - 2, MOD)
  
  
  def nck(n, k, kaijyo):
      return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD
  
  
  def npk(n, k, kaijyo):
      if k == 0 or k == n:
          return n % MOD
      return (kaijyo[n] * divide(kaijyo[n - k])) % MOD
  
  
  def fact_and_inv(SIZE):
      inv = [0] * SIZE  # inv[j] = j^{-1} mod MOD
      fac = [0] * SIZE  # fac[j] = j! mod MOD
      finv = [0] * SIZE  # finv[j] = (j!)^{-1} mod MOD
      inv[1] = 1
      fac[0] = fac[1] = 1
      finv[0] = finv[1] = 1
      for i in range(2, SIZE):
          inv[i] = MOD - (MOD // i) * inv[MOD % i] % MOD
          fac[i] = fac[i - 1] * i % MOD
          finv[i] = finv[i - 1] * inv[i] % MOD
  
      return fac, finv
  
  
  def renritsu(A, Y):
      # example 2x + y = 3, x + 3y = 4
      # A = [[2,1], [1,3]])
      # Y = [[3],[4]] または [3,4]
      A = np.matrix(A)
      Y = np.matrix(Y)
      Y = np.reshape(Y, (-1, 1))
      X = np.linalg.solve(A, Y)
  
      # [1.0, 1.0]
      return X.flatten().tolist()[0]
  
  
  class TwoDimGrid:
      # 2次元座標 -> 1次元
      def __init__(self, h, w, wall="#"):
          self.h = h
          self.w = w
          self.size = (h + 2) * (w + 2)
          self.wall = wall
          self.get_grid()
          # self.init_cost()
  
      def get_grid(self):
          grid = [self.wall * (self.w + 2)]
          for i in range(self.h):
              grid.append(self.wall + getS() + self.wall)
  
          grid.append(self.wall * (self.w + 2))
          self.grid = grid
  
      def init_cost(self):
          self.cost = [INF] * self.size
  
      def pos(self, x, y):
          # 壁も含めて0-indexed 元々の座標だけ考えると1-indexed
          return y * (self.w + 2) + x
  
      def getgrid(self, x, y):
          return self.grid[y][x]
  
      def get(self, x, y):
          return self.cost[self.pos(x, y)]
  
      def set(self, x, y, v):
          self.cost[self.pos(x, y)] = v
          return
  
      def show(self):
          for i in range(self.h + 2):
              print(self.cost[(self.w + 2) * i : (self.w + 2) * (i + 1)])
  
      def showsome(self, tgt):
          for t in tgt:
              print(t)
          return
  
      def showsomejoin(self, tgt):
          for t in tgt:
              print("".join(t))
          return
  
      def search(self):
          grid = self.grid
          move = [(0, 1), (0, -1), (1, 0), (-1, 0)]
          move_eight = [
              (0, 1),
              (0, -1),
              (1, 0),
              (-1, 0),
              (1, 1),
              (1, -1),
              (-1, 1),
              (-1, -1),
          ]
          # for i in range(1, self.h+1):
          #     for j in range(1, self.w+1):
          #         cx, cy = j, i
          #         for dx, dy in move_eight:
          #             nx, ny = dx + cx, dy + cy
  
  
  def solve():
      a, b = getList()
      print(500, 500)
      for i in range(500):
          tmp = []
          for j in range(500):
              if i < 250:
                  if j % 2 == 1 or i % 2 == 1 or a <= 1:
                      tmp.append("#")
                  else:
                      tmp.append(".")
                      a -= 1
              else:
                  if j % 2 == 1 or i % 2 == 0 or b <= 1:
                      tmp.append(".")
                  else:
                      tmp.append("#")
                      b -= 1
  
          print("".join(tmp))
  
  
  def main():
      n = getN()
      for _ in range(n):
          s = "".join([random.choice(["F", "T"]) for i in range(20)])
          print(s)
          solve(s, 1, 0)
  
      return
  
  
  if __name__ == "__main__":
      # main()
      solve()
  
problem_description: 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.
samples: [{"input": "2 3", "output": "3 3\n    ##.\n    ..#\n    #.#\n    \n\nThis output corresponds to the grid below:\n\n![2701558bf42f7c088abad927b419472a.png](https://img.atcoder.jp/arc093/2701558bf42f7c088abad927b419472a.png)\n\n* * *"}, {"input": "7 8", "output": "3 5\n    #.#.#\n    .#.#.\n    #.#.#\n    \n\n* * *"}, {"input": "1 1", "output": "4 2\n    ..\n    #.\n    ##\n    ##\n    \n\n* * *"}, {"input": "3 14", "output": "8 18\n    ..................\n    ..................\n    ....##.......####.\n    ....#.#.....#.....\n    ...#...#....#.....\n    ..#.###.#...#.....\n    .#.......#..#.....\n    #.........#..####."}]