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

#########
........#
#########
#........
#########
........#
#########
#........
#########
public class Test11 {

	public static void main(String[] args) {
		java.util.Scanner s = new java.util.Scanner(System.in);
		int n = s.nextInt();
		int m = s.nextInt();
		String[][] c = new String[n][m];
		boolean f = true;
		int counter = 0;
		for (int i = 0; i < n; i++) {
			
			if (isEven(i)) {
				for (int j = 0; j < m; j++) {
					c[i][j] = "#";
				}
			} else{
				if (f) 
				{
					for (int j = 0; j < m - 1; j++) {
						c[i][j] = ".";
					}
					c[i][m - 1] = "#";
					f = false;
				}
				else{
					c[i][0] = "#";
					for (int j = 1; j < m; j++) {
						c[i][j] = ".";
					}
					f = true;
				}
			}
			
			counter++;
		}
		for (int g = 0; g < n; g++) {
			for (int h = 0; h < m; h++) {
				System.out.print(c[g][h]);
			}
			System.out.println();
		}
	}

	public static boolean isEven(int i) {
		if ((i % 2) == 0) {
			return true;
		}
		return false;
	}

	public static boolean isOdd(int i) {
		if(i==1) return true;
		if ((i % 2) != 0) {
			return true;
		}
		return false;
	}

}
