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

#########
........#
#########
#........
#########
........#
#########
#........
#########
#!/usr/bin/env python3
"""
CodeForces
510 A. Fox and Snake

@author yamaton
@date 2015-07-30
"""


def solve(n, m):
    grid = [['.'] * m for _ in range(n)]
    for i in range(0, n, 2):
        grid[i] = '#' * m

    for i in range(1, n, 2):
        if i % 4 == 1:
            grid[i][-1] = '#'
        elif i % 4 == 3:
            grid[i][0] = '#'

    return '\n'.join(''.join(xs) for xs in grid)


def tf_to_message(tf):
    if tf:
        return 'I become the guy.'
    else:
        return 'Oh, my keyboard!'


def main():
    [n, m] = [int(i) for i in input().strip().split()]
    assert n % 2 == 1
    result = solve(n, m)
    print(result)


if __name__ == '__main__':
    main()
