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.*;
import java.io.*;

public class _510A implements Runnable {

    static BufferedReader br = null;
    static PrintWriter pw = null;
    static StringTokenizer stk = new StringTokenizer("");

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

    public void run() {

        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new OutputStreamWriter(System.out));
        solver();
        pw.close();
    }

    public void nline() {
        try {
            stk = new StringTokenizer(br.readLine());
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private String nstr() {
        while (!stk.hasMoreTokens())
            nline();
        return stk.nextToken();
    }

    private int ni() {
        return Integer.valueOf(nstr());
    }

    private long nl() {
        return Long.valueOf(nstr());
    }

    private double nd() {
        return Double.valueOf(nstr());
    }

    String nextLine() {
        try {
            return br.readLine();
        } catch (IOException e) {
        }
        return null;
    }

    private void solver() {
        int n = ni(), m = ni();
        char[][] mas = new char[n][m];
        //for (int i = 0; i < n; i++)
            //Arrays.fill(mas[i], '#');
        for (int i =0; i<n; i++)
            for (int j =0; j<m; j++)
                mas[i][j] = '#';
            
            
        for (int i = 1; i < n; i += 4) {
            for (int j = 0; j < m-1; j++) {
                mas[i][j] = '.';
            }
        }
        for (int i = 3; i < n; i += 4) {
            for (int j = 1; j < m; j++) {
                mas[i][j] = '.';
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                System.out.print(mas[i][j]);
            }
            System.out.println();
        }

    }
}
