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

#########
........#
#########
#........
#########
........#
#########
#........
#########
import java.util.*;


public class CodeForces implements Runnable {
	
	private Scanner scanner;

	public static void main(String args[]) {
		new Thread(new CodeForces()).start();
	}

	public void run() {

		scanner = new Scanner(System.in);

		solution();

		scanner.close();
	}

	//158B

	public void solution() {
		int n = scanner.nextInt();
		int m = scanner.nextInt();

		String lattice = "";
		String a = "";
		String b = "";

		for (int i = 1; i <= m; i++) {
			lattice += "#";

			if (i == m) {
				a += "#";
			} else {
				a += ".";
			}

			if (i == 1) {
				b += "#";
			} else {
				b += ".";
			}
		}

		boolean flag = true;

		for (int i = 1; i <= n; i++) {
			if (i % 2 == 1) {
				System.out.println(lattice);
			} else {
				if (flag) {
					System.out.println(a);

					flag = false;
				} else {
					System.out.println(b);

					flag = true;
				}
			}
		}
	}

	class Schedule {
		private int x;
		private int y;

		public Schedule(int x, int y) {
			this.x = x;
			this.y = y;
		}
	}

	private boolean isPrime(int n) {
		if (n <= 1) {
			return false;
		} else if (n <= 3) {
			return true;
		} else if (n % 2 == 0 || n % 3 == 0) {
			return false;
		}

		int i = 5;

		while (i * i <= n) {
			if (n % i == 0 || n % (i + 2) == 0) {
				return false;
			}

			i = i + 6;
		}

		return true;
	}

}