Fox Ciel starts to learn programming. The first task is drawing a fox! However, that turns out to be too hard for a beginner, so she decides to draw a snake instead.

A snake is a pattern on a n by m table. Denote c-th cell of r-th row as (r, c). The tail of the snake is located at (1, 1), then it's body extends to (1, m), then goes down 2 rows to (3, m), then goes left to (3, 1) and so on.

Your task is to draw this snake for Fox Ciel: the empty cells should be represented as dot characters ('.') and the snake cells should be filled with number signs ('#').

Consider sample tests in order to understand the snake pattern.

Input

The only line contains two integers: n and m (3 ≤ n, m ≤ 50). 

n is an odd number.

Output

Output n lines. Each line should contain a string consisting of m characters. Do not output spaces.

Examples

Input

3 3


Output

###
..#
###


Input

3 4


Output

####
...#
####


Input

5 3


Output

###
..#
###
#..
###


Input

9 9


Output

#########
........#
#########
#........
#########
........#
#########
#........
#########
# -*- coding: utf-8 -*-
import sys


def solve_problem_510a(line, row):
    road_map = []
    for line_idx in xrange(line):
        row_list = []
        for row_idx in xrange(row):
            row_list.append(".")
        road_map.append(row_list)

    for line_idx in xrange(line):
        if line_idx % 2 == 0:
            road_map[line_idx] = ["#" for row_idx in road_map[line_idx]]
        elif (4 * ((line_idx//4)+1)) - 3 == line_idx:
            road_map[line_idx][row-1] = "#"
        else:
            road_map[line_idx][0] = "#"

    for i in xrange(line):
        for j in xrange(row):
            sys.stdout.write(road_map[i][j])
        print


if __name__ == "__main__":
    (n, m) = map(int, (str.split(raw_input())))
    solve_problem_510a(n, m)

