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.io.*;
import java.util.*;
public class word{
    void dotHash(int m){
        for(int i=1;i<=m-1;i++){
            System.out.print(".");
        }
        System.out.println("#");
    }
    void hashDot(int m){
        System.out.print("#");
        for(int i=1;i<=m-1;i++){
            System.out.print(".");
        }
        System.out.println();
    }
    void hash(int m){
        for(int i=1;i<=m;i++){
            System.out.print("#");
        }
        System.out.println();
    }
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        word obj = new word();
        int n,m,i,k=1,flag=0;
        n = sc.nextInt();
        m = sc.nextInt();
        while(k<=n){
            if(k%2==0){
                if(flag==0){
                    obj.dotHash(m);
                    flag=1;
                    k++;
                }else if(flag==1){
                    obj.hashDot(m);
                    flag=0;
                    k++;
                }
            }else{
                obj.hash(m);
                k++;
            }
        }
    }
}