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

#########
........#
#########
#........
#########
........#
#########
#........
#########
#include <bits/stdc++.h>
bool full = true;
bool last = true;
std::string snake(int input) {
  std::string out;
  if (full == true) {
    for (int i = 0; i < input; ++i) {
      out += '#';
    }
    full = !full;
    return out;
  } else {
    if (last == true) {
      for (int i = 0; i < input - 1; ++i) {
        out += '.';
      }
      out += '#';
      full = !full;
      last = !last;
      return out;
    } else {
      out += '#';
      for (int i = 0; i < input - 1; ++i) {
        out += '.';
      }
      full = !full;
      last = !last;
      return out;
    }
  }
}
int main() {
  int n, m;
  std::cin >> n >> m;
  while (n--) {
    std::cout << snake(m) << "\n";
  }
}
