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.*;

/**
 * Created by jaha on 13.03.16.
 */
public class FoxAndSnake {

    public static void main(String[] args) throws IOException
    {
        new FoxAndSnake().run();
    }

    StreamTokenizer in;
    PrintWriter out;

    int nextInt() throws IOException
    {
        in.nextToken();
        return (int)in.nval;
    }


    void run() throws IOException
    {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(new OutputStreamWriter(System.out));
        solve();
        out.flush();
    }

    void solve() throws IOException
    {
        int n = nextInt();
        int m = nextInt();
        char[][] snake = new char[n][m];
        int left = 0;
        char symbol = '#';

        for(int i = 0; i < n; i ++) {
            for (int k = 0; k < m; k++) {
                snake[i][k] = symbol;
            }

            symbol = (symbol == '#') ? '.' : '#';
            if (i % 2 != 0) {
                if (left == 0) {
                    snake[i][m - 1] = '#';
                    left = 1;
                } else {
                    snake[i][0] = '#';
                    left = 0;
                }
            }
        }


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


    }
}
